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

DOI10.1112/JLMS/S2-8.4.681zbMATH Open0288.05001OpenAlexW2049912587WikidataQ56444799 ScholiaQ56444799MaRDI QIDQ4775868FDOQ4775868

Paul 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)

Cited In (11)

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

This page was built for publication: A Note on a Combinatorial Problem of ErdŐS and Hajnal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775868)