On A Combinatorial Problem of Erdös
From MaRDI portal
Publication:5587081
DOI10.4153/CMB-1969-107-xzbMath0192.33203WikidataQ56444804 ScholiaQ56444804MaRDI QIDQ5587081
Publication date: 1969
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ Sparse color‐critical graphs and hypergraphs with no short cycles ⋮ Color-critical graphs and hypergraphs with few edges and no short cycles ⋮ The enumeration problem for color critical linear hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ On the construction of non-2-colorable uniform hypergraphs ⋮ On the chromatic number of set systems ⋮ Improved Bounds for Uniform Hypergraphs without Property B ⋮ On property B and on Steiner systems ⋮ The existence problem for colour critical linear hypergraphs ⋮ Colour-critical graphs and hypergraphs ⋮ Sparse colour-critical hypergraphs
This page was built for publication: On A Combinatorial Problem of Erdös
