Sparse colour-critical hypergraphs

DOI10.1007/BF02125892zbMath0732.05024WikidataQ30039725 ScholiaQ30039725MaRDI QIDQ809089

N. E. Zubov

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

hypergraph; linear; chromatic number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

Color-critical graphs and hypergraphs with few edges and no short cycles, On the number of edges in hypergraphs critical with respect to strong colourings

Cites Work

• Unnamed Item
• Unnamed Item
• On 3-chromatic hypergraphs
• The enumeration problem for color critical linear hypergraphs
• Coloring n-sets red and blue
• On property B and on Steiner systems
• Colour-critical graphs and hypergraphs
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• The existence problem for colour critical linear hypergraphs
• On Property B of Families of Sets
• ON THE TWO-COLOURING OF HYPERGRAPHS
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• On a Combinatorial Problem of Erdös and Hajnal
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On chromatic number of graphs and set-systems
• On A Combinatorial Problem of Erdös
• On A Combinatorial Problem III
• On a combinatorial problem. II
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs