A Note on a Combinatorial Problem of ErdŐS and Hajnal

DOI10.1112/jlms/s2-8.4.681zbMath0288.05001OpenAlexW2049912587WikidataQ56444799 ScholiaQ56444799MaRDI QIDQ4775868

P. D. Seymour

Publication date: 1974

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-8.4.681

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

Extremal problems in hypergraph colourings, On the minimum size of 4-uniform hypergraphs without property \(B\), On colorings of 3-homogeneous hypergraphs in 3 colors, On property B(s). II, On the construction of non-2-colorable uniform hypergraphs, On balanced colorings of hypergraphs, Improved Bounds for Uniform Hypergraphs without Property B, On property B and on Steiner systems, On the chromatic number of generalized Kneser graphs and Hadamard matrices, 2-colorability of \(r\)-uniform hypergraphs, Sparse colour-critical hypergraphs