On a Combinatorial Problem of Erdös and Hajnal
From MaRDI portal
Publication:5339311
DOI10.4153/CMB-1964-016-9zbMath0131.01302OpenAlexW2907250375MaRDI QIDQ5339311
Publication date: 1964
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1964-016-9
Related Items (10)
On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ On packing time-respecting arborescences ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ On property B(s). II ⋮ On the construction of non-2-colorable uniform hypergraphs ⋮ On-line algorithms for 2-coloring hypergraphs via chip games ⋮ Improved Bounds for Uniform Hypergraphs without Property B ⋮ The \(B_r\) property and chromatic numbers of generalized graphs ⋮ Sparse colour-critical hypergraphs
This page was built for publication: On a Combinatorial Problem of Erdös and Hajnal
