Sparse colour-critical hypergraphs
From MaRDI portal
Publication:809089
DOI10.1007/BF02125892zbMATH Open0732.05024OpenAlexW2009629999WikidataQ30039725 ScholiaQ30039725MaRDI QIDQ809089FDOQ809089
Authors: N. E. Zubov 
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125892
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- On a Combinatorial Problem of Erdös and Hajnal
- On A Combinatorial Problem of Erdös
- On chromatic number of graphs and set-systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On 3-chromatic hypergraphs
- On a combinatorial problem. II
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- The existence problem for colour critical linear hypergraphs
- Coloring n-sets red and blue
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- On Property B of Families of Sets
- ON THE TWO-COLOURING OF HYPERGRAPHS
- On property B and on Steiner systems
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- The enumeration problem for color critical linear hypergraphs
- Colour-critical graphs and hypergraphs
- On A Combinatorial Problem III
Cited In (6)
- Restricted extension of sparse partial edge colorings of hypercubes
- On the number of edges in hypergraphs critical with respect to strong colourings
- The local cut lemma
- Color-critical graphs and hypergraphs with few edges: a survey
- Sparse \(H\)-colourable graphs of bounded maximum degree
- Color-critical graphs and hypergraphs with few edges and no short cycles
This page was built for publication: Sparse colour-critical hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809089)
