Some new bounds on partition critical hypergraphs

DOI10.1016/j.ejc.2011.09.023zbMath1239.05131OpenAlexW2047498160MaRDI QIDQ412276

Attila Sali, Zoltan Fueredi

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.023

zbMATH Keywords

color critical hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• On 3-chromatic hypergraphs
• Forestation in hypergraphs: Linear \(k\)-trees
• A survey of forbidden configuration results
• The existence problem for colour critical linear hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• Color critical hypergraphs with many edges
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some new bounds on partition critical hypergraphs