{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/87975"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/87975","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Coloring and constructing (hyper)graphs with restrictions","abstract":"We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges. We prove a conjecture of Chen, Erdős, Gyárfás, and Schelp concerning the minimum number of edges in a “nearly bipartite” 4-critical graph. In Chapter 3 we consider coloring and list-coloring graphs and hypergraphs with few edges and no small cycles. We prove two main results. If a bipartite graph has maximum average degree at most 2(k−1), then it is colorable from lists of size k; we prove that this is sharp, even with an additional girth requirement. Using the same approach, we also provide a simple construction of graphs with arbitrarily large girth and chromatic number (first proved to exist by Erdős). In Chapter 4 we consider list-coloring the family of kth power graphs. Kostochka and Woodall conjectured that graph squares are chromatic-choosable, as a strengthening of the Total List Coloring Conjecture. Kim and Park disproved this stronger conjecture, and Zhu asked whether graph kth powers are chromatic-choosable for any k. We show that this is not true: we construct families of graphs based on affine planes whose choice number exceeds their chromatic number by a logarithmic factor. In Chapter 5 we consider the existence of uniform hypergraphs with prescribed degrees and codegrees. In Section 5.2, we show that a generalization of the graphic 2-switch is insufficient to connect realizations of a given degree sequence. In Section 5.3, we consider an operation on 3-graphs related to the octahedron that preserves codegrees; this leads to an inductive definition for 2-colorable triangulations of the sphere. In Section 5.4, we discuss the notion of fractional realizations of degree sequences, in particular noting the equivalence of the existence of a realization and the existence of a fractional realization in the graph and multihypergraph cases. In Chapter 6 we consider a question concerning poset dimension. Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of sqrt(dn) was observed by Goodwillie. We provide a sublinear upper bound.","abstract_html":"We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges. We prove a conjecture of Chen, Erdős, Gyárfás, and Schelp concerning the minimum number of edges in a “nearly bipartite” 4-critical graph. In Chapter 3 we consider coloring and list-coloring graphs and hypergraphs with few edges and no small cycles. We prove two main results. If a bipartite graph has maximum average degree at most 2(k−1), then it is colorable from lists of size k; we prove that this is sharp, even with an additional girth requirement. Using the same approach, we also provide a simple construction of graphs with arbitrarily large girth and chromatic number (first proved to exist by Erdős). In Chapter 4 we consider list-coloring the family of kth power graphs. Kostochka and Woodall conjectured that graph squares are chromatic-choosable, as a strengthening of the Total List Coloring Conjecture. Kim and Park disproved this stronger conjecture, and Zhu asked whether graph kth powers are chromatic-choosable for any k. We show that this is not true: we construct families of graphs based on affine planes whose choice number exceeds their chromatic number by a logarithmic factor. In Chapter 5 we consider the existence of uniform hypergraphs with prescribed degrees and codegrees. In Section 5.2, we show that a generalization of the graphic 2-switch is insufficient to connect realizations of a given degree sequence. In Section 5.3, we consider an operation on 3-graphs related to the octahedron that preserves codegrees; this leads to an inductive definition for 2-colorable triangulations of the sphere. In Section 5.4, we discuss the notion of fractional realizations of degree sequences, in particular noting the equivalence of the existence of a realization and the existence of a fractional realization in the graph and multihypergraph cases. In Chapter 6 we consider a question concerning poset dimension. Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of sqrt(dn) was observed by Goodwillie. We provide a sublinear upper bound.","abstract_has_math":false,"creators":["Reiniger, Benjamin M"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Kostochka, Alexandr V.","West, Douglas B.","Reznick, Bruce A.","Molla, Theodore"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-29T20:37:48Z","date_published":"2015-09-29T20:37:48Z","updated_at":"2026-07-22T22:26:31Z","subjects":["graph coloring","hypergraph coloring","critical graphs","list coloring","hypergraph degrees","poset dimension"],"languages":["en"],"rights":["Copyright 2015 Benjamin M. Reiniger"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/87975","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kostochka, Alexandr V.","West, Douglas B.","Reznick, Bruce A.","Molla, Theodore"]},{"key":"dc:creator","label":"Author","values":["Reiniger, Benjamin M"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-29T20:37:48Z","2015-08","2015-07-06","2015-8"]},{"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":["graph coloring","hypergraph coloring","critical graphs","list coloring","hypergraph degrees","poset dimension"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Benjamin M. Reiniger"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/87975"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges. We prove a conjecture of Chen, Erdős, Gyárfás, and Schelp concerning the minimum number of edges in a “nearly bipartite” 4-critical graph. In Chapter 3 we consider coloring and list-coloring graphs and hypergraphs with few edges and no small cycles. We prove two main results. If a bipartite graph has maximum average degree at most 2(k−1), then it is colorable from lists of size k; we prove that this is sharp, even with an additional girth requirement. Using the same approach, we also provide a simple construction of graphs with arbitrarily large girth and chromatic number (first proved to exist by Erdős). In Chapter 4 we consider list-coloring the family of kth power graphs. Kostochka and Woodall conjectured that graph squares are chromatic-choosable, as a strengthening of the Total List Coloring Conjecture. Kim and Park disproved this stronger conjecture, and Zhu asked whether graph kth powers are chromatic-choosable for any k. We show that this is not true: we construct families of graphs based on affine planes whose choice number exceeds their chromatic number by a logarithmic factor. In Chapter 5 we consider the existence of uniform hypergraphs with prescribed degrees and codegrees. In Section 5.2, we show that a generalization of the graphic 2-switch is insufficient to connect realizations of a given degree sequence. In Section 5.3, we consider an operation on 3-graphs related to the octahedron that preserves codegrees; this leads to an inductive definition for 2-colorable triangulations of the sphere. In Section 5.4, we discuss the notion of fractional realizations of degree sequences, in particular noting the equivalence of the existence of a realization and the existence of a fractional realization in the graph and multihypergraph cases. In Chapter 6 we consider a question concerning poset dimension. Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of sqrt(dn) was observed by Goodwillie. We provide a sublinear upper bound.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Benjamin Reiniger, accepted the attached license on 2015-06-24 at 13:19.","The student, Benjamin Reiniger, submitted this Dissertation for approval on 2015-06-24 at 17:34.","This Dissertation was approved for publication on 2015-07-06 at 13:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8308 on 2015-09-29 at 13:21:38","Made available in DSpace on 2015-09-29T20:37:48Z (GMT). No. of bitstreams: 2 REINIGER-DISSERTATION-2015.pdf: 538625 bytes, checksum: d7338ace4423aa92753c22c1f3d06e37 (MD5) LICENSE.txt: 4214 bytes, checksum: 26bc2776a71e605c05818c216b129d0c (MD5) Previous issue date: 2015-07-06"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Coloring and constructing (hyper)graphs with restrictions"]}]}],"canonical_facts":{"dc:contributor":["Kostochka, Alexandr V.","West, Douglas B.","Reznick, Bruce A.","Molla, Theodore"],"dc:creator":["Reiniger, Benjamin M"],"dc:date":["2015-09-29T20:37:48Z","2015-08","2015-07-06","2015-8"],"dc:description":["We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges. We prove a conjecture of Chen, Erdős, Gyárfás, and Schelp concerning the minimum number of edges in a “nearly bipartite” 4-critical graph. In Chapter 3 we consider coloring and list-coloring graphs and hypergraphs with few edges and no small cycles. We prove two main results. If a bipartite graph has maximum average degree at most 2(k−1), then it is colorable from lists of size k; we prove that this is sharp, even with an additional girth requirement. Using the same approach, we also provide a simple construction of graphs with arbitrarily large girth and chromatic number (first proved to exist by Erdős). In Chapter 4 we consider list-coloring the family of kth power graphs. Kostochka and Woodall conjectured that graph squares are chromatic-choosable, as a strengthening of the Total List Coloring Conjecture. Kim and Park disproved this stronger conjecture, and Zhu asked whether graph kth powers are chromatic-choosable for any k. We show that this is not true: we construct families of graphs based on affine planes whose choice number exceeds their chromatic number by a logarithmic factor. In Chapter 5 we consider the existence of uniform hypergraphs with prescribed degrees and codegrees. In Section 5.2, we show that a generalization of the graphic 2-switch is insufficient to connect realizations of a given degree sequence. In Section 5.3, we consider an operation on 3-graphs related to the octahedron that preserves codegrees; this leads to an inductive definition for 2-colorable triangulations of the sphere. In Section 5.4, we discuss the notion of fractional realizations of degree sequences, in particular noting the equivalence of the existence of a realization and the existence of a fractional realization in the graph and multihypergraph cases. In Chapter 6 we consider a question concerning poset dimension. Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of sqrt(dn) was observed by Goodwillie. We provide a sublinear upper bound.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Benjamin Reiniger, accepted the attached license on 2015-06-24 at 13:19.","The student, Benjamin Reiniger, submitted this Dissertation for approval on 2015-06-24 at 17:34.","This Dissertation was approved for publication on 2015-07-06 at 13:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8308 on 2015-09-29 at 13:21:38","Made available in DSpace on 2015-09-29T20:37:48Z (GMT). No. of bitstreams: 2 REINIGER-DISSERTATION-2015.pdf: 538625 bytes, checksum: d7338ace4423aa92753c22c1f3d06e37 (MD5) LICENSE.txt: 4214 bytes, checksum: 26bc2776a71e605c05818c216b129d0c (MD5) Previous issue date: 2015-07-06"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/87975"],"dc:language":["en"],"dc:rights":["Copyright 2015 Benjamin M. Reiniger"],"dc:subject":["graph coloring","hypergraph coloring","critical graphs","list coloring","hypergraph degrees","poset dimension"],"dc:title":["Coloring and constructing (hyper)graphs with restrictions"],"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:31Z"}