{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/86969"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/86969","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings","abstract":"Let f(n, p, q) be the minimum number of colors required to color the edges of Kn in such a way that the edges of every Kp⊆Kn together receive at least q colors. We focus on determining f(n, 4, 3) and prove a constructive upper bound of eOlogn . This improves on the previous best (probabilistic) bound of On (due to Erdos and Gyarfas).","abstract_html":"Let f(n, p, q) be the minimum number of colors required to color the edges of Kn in such a way that the edges of every Kp⊆Kn together receive at least q colors. We focus on determining f(n, 4, 3) and prove a constructive upper bound of eOlogn . This improves on the previous best (probabilistic) bound of On (due to Erdos and Gyarfas).","abstract_has_math":false,"creators":["Mubayi, Dhruv"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["West, Douglas B."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-28T15:20:24Z","date_published":"2015-09-28T15:20:24Z","updated_at":"2026-07-22T22:26:28Z","subjects":["Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9912323"],"render_values":[{"text":"(MiAaPQ)AAI9912323","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/86969","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["West, Douglas B."]},{"key":"dc:creator","label":"Author","values":["Mubayi, Dhruv"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-28T15:20:24Z","10000-01-01","1998"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/86969","(MiAaPQ)AAI9912323"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Let f(n, p, q) be the minimum number of colors required to color the edges of Kn in such a way that the edges of every Kp⊆Kn together receive at least q colors. We focus on determining f(n, 4, 3) and prove a constructive upper bound of eOlogn . This improves on the previous best (probabilistic) bound of On (due to Erdos and Gyarfas).","Made available in DSpace on 2015-09-28T15:20:24Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9912323.pdf: 5479988 bytes, checksum: 9a85c008618939fa30be17db4ae2ab82 (MD5) Previous issue date: 1998","Embargo set by: Seth Robbins for item 88250 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","125 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998."]},{"key":"dc:title","label":"Title","values":["Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings"]}]}],"canonical_facts":{"dc:contributor":["West, Douglas B."],"dc:creator":["Mubayi, Dhruv"],"dc:date":["2015-09-28T15:20:24Z","10000-01-01","1998"],"dc:description":["Let f(n, p, q) be the minimum number of colors required to color the edges of Kn in such a way that the edges of every Kp⊆Kn together receive at least q colors. We focus on determining f(n, 4, 3) and prove a constructive upper bound of eOlogn . This improves on the previous best (probabilistic) bound of On (due to Erdos and Gyarfas).","Made available in DSpace on 2015-09-28T15:20:24Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9912323.pdf: 5479988 bytes, checksum: 9a85c008618939fa30be17db4ae2ab82 (MD5) Previous issue date: 1998","Embargo set by: Seth Robbins for item 88250 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","125 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998."],"dc:identifier":["http://hdl.handle.net/2142/86969","(MiAaPQ)AAI9912323"],"dc:language":["eng"],"dc:subject":["Mathematics"],"dc:title":["Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings"],"dc:type":["text"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:28Z"}