{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/86902"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/86902","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Delta-System Methods in Contemporary Graph Theory","abstract":"Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.","abstract_html":"Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.","abstract_has_math":false,"creators":["Prince, Noah B."],"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:06Z","date_published":"2015-09-28T15:20:06Z","updated_at":"2026-07-22T22:26:28Z","subjects":["Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3314867"],"render_values":[{"text":"(MiAaPQ)AAI3314867","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/86902","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":["Prince, Noah B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-28T15:20:06Z","10000-01-01","2008"]},{"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/86902","(MiAaPQ)AAI3314867"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.","Made available in DSpace on 2015-09-28T15:20:06Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3314867.pdf: 1406087 bytes, checksum: 4e133118f4ee58378072665de2ed1fde (MD5) Previous issue date: 2008","Embargo set by: Seth Robbins for item 88183 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","102 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008."]},{"key":"dc:title","label":"Title","values":["Delta-System Methods in Contemporary Graph Theory"]}]}],"canonical_facts":{"dc:contributor":["West, Douglas B."],"dc:creator":["Prince, Noah B."],"dc:date":["2015-09-28T15:20:06Z","10000-01-01","2008"],"dc:description":["Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.","Made available in DSpace on 2015-09-28T15:20:06Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3314867.pdf: 1406087 bytes, checksum: 4e133118f4ee58378072665de2ed1fde (MD5) Previous issue date: 2008","Embargo set by: Seth Robbins for item 88183 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","102 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008."],"dc:identifier":["http://hdl.handle.net/2142/86902","(MiAaPQ)AAI3314867"],"dc:language":["eng"],"dc:subject":["Mathematics"],"dc:title":["Delta-System Methods in Contemporary Graph Theory"],"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"}