Color critical hypergraphs with many edges

DOI10.1002/JGT.20166MaRDI QIDQ5487778zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, Mark Siggers

Publication date 12 September 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20166

zbMATH Keywords

minimal partial Steiner system

Mathematics Subject Classification ID

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

Recommendations

• Color-critical graphs and hypergraphs with few edges: a survey
• On the number of edges in colour-critical graphs and hypergraphs
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• Color-critical graphs and hypergraphs with few edges and no short cycles
• Some new bounds on partition critical hypergraphs

Cited in

(15)

• On the number of edges in colour-critical graphs and hypergraphs
• Color-critical graphs and hypergraphs with few edges: a survey
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• Colorations Extrêmes Dans Les Hypergraphes
• Some new bounds on partition critical hypergraphs
• Colour-critical graphs with few edges
• XSAT and NAE-SAT of linear CNF classes
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On the number of edges in hypergraphs critical with respect to strong colourings
• On color critical graphs with large adaptable chromatic numbers
• NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
• scientific article; zbMATH DE number 5763169 (Why is no real title available?)
• Edge-coloring critical graphs with high degree
• Partition critical hypergraphs
• Supersaturation problem for color-critical graphs

This page was built for publication: Color critical hypergraphs with many edges

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