Partition critical hypergraphs

DOI10.1016/J.ENDM.2009.07.095MaRDI QIDQ2851519zbMATH OpenOpenAlexFDO

Authors Attila Sali, Zoltán Füredi

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.095

zbMATH Keywords

color criticalhypergraph partitionuniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Some new bounds on partition critical hypergraphs
• Color critical hypergraphs with many edges
• scientific article; zbMATH DE number 5546
• On judicious partitions of uniform hypergraphs
• Color-critical graphs and hypergraphs with few edges: a survey

Cites work

• A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials
• 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 3485832 (Why is no real title available?)

Cited in

(3)

• Partitioning ordered hypergraphs
• Some new bounds on partition critical hypergraphs
• Linearly ordered colourings of hypergraphs

This page was built for publication: Partition critical hypergraphs

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