The enumeration problem for color critical linear hypergraphs

DOI10.1016/0095-8956(80)90047-7zbMath0443.05051OpenAlexW2009626780MaRDI QIDQ1144047

S. H. Smith

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90047-7

zbMATH Keywords

enumerationcolor critical linear hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

Sparse colour-critical hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colour-critical graphs and hypergraphs
• Regularity and Positional Games
• The existence problem for colour critical linear hypergraphs
• On Property of Families of Sets
• On critical 3-chromatic hypergraphs
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• On A Combinatorial Problem of Erdös
• On a property of families of sets
• An Application of Ramsay's Theorem to a Problem of Erdos and Hajnal
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: The enumeration problem for color critical linear hypergraphs