Some new bounds on partition critical hypergraphs

DOI10.1016/J.EJC.2011.09.023zbMATH Open1239.05131OpenAlexW2047498160MaRDI QIDQ412276FDOQ412276

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

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

zbMATH Keywords

color critical hypergraph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• Title not available (Why is that?)
• A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• A survey of forbidden configuration results
• Forestation in hypergraphs: Linear \(k\)-trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• The existence problem for colour critical linear hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Color critical hypergraphs with many edges
• Title not available (Why is that?)

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)