Sparse colour-critical hypergraphs

DOI10.1007/BF02125892zbMath0732.05024OpenAlexW2009629999WikidataQ30039725 ScholiaQ30039725MaRDI QIDQ809089

N. E. Zubov

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02125892

zbMATH Keywords

hypergraphlinearchromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

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 ⋮ The local cut lemma

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

This page was built for publication: Sparse colour-critical hypergraphs