Color critical hypergraphs with many edges
From MaRDI portal
Publication:5487778
DOI10.1002/JGT.20166zbMATH Open1098.05033OpenAlexW4255306742MaRDI QIDQ5487778FDOQ5487778
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
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)
- Title not available (Why is that?)
- Some new bounds on partition critical hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the number of edges in hypergraphs critical with respect to strong colourings
- Edge-coloring critical graphs with high degree
- XSAT and NAE-SAT of linear CNF classes
- 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
- On color critical graphs with large adaptable chromatic numbers
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
- Colour-critical graphs with few edges
- Partition critical hypergraphs
- Color-critical graphs and hypergraphs with few edges: a survey
- Colorations Extrêmes Dans Les Hypergraphes
- 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)
