Some new bounds on partition critical hypergraphs

DOI10.1016/J.EJC.2011.09.023MaRDI QIDQ412276zbMATH OpenOpenAlexFDO

Authors Attila Sali, Zoltán Füredi

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

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

Recommendations

• Partition critical hypergraphs
• Color critical hypergraphs with many edges
• scientific article; zbMATH DE number 5546
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• On the number of edges in colour-critical graphs and hypergraphs

Cites work

• scientific article; zbMATH DE number 5763169 (Why is no real title available?)
• scientific article; zbMATH DE number 3661343 (Why is no real title available?)
• scientific article; zbMATH DE number 3722680 (Why is no real title available?)
• scientific article; zbMATH DE number 3485832 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• scientific article; zbMATH DE number 3361909 (Why is no real title available?)
• A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials
• A survey of forbidden configuration results
• Color critical hypergraphs with many edges
• Forestation in hypergraphs: Linear \(k\)-trees
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• Some Theorems on Abstract Graphs
• The existence problem for colour critical linear hypergraphs

Cited in

(3)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Color critical hypergraphs with many edges
• Partition critical hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412276)