Hypergraphs and Ramseyian Theorems

DOI10.2307/2036470zbMath0255.05108OpenAlexW4249611931MaRDI QIDQ5668497

No author found.

Publication date: 1971

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

Full work available at URL: https://doi.org/10.2307/2036470

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Some properties of non-bicolorable hypergraphs and the four-color problem ⋮ The Ramsey numbers r(P\(_m\),K\(_n\)) ⋮ On multiaspect graphs ⋮ Lower bounds for some Ramsey numbers ⋮ Ramsey graphs and block designs ⋮ Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) ⋮ On Turan hypergraphs ⋮ Ramsey Graphs and Block Designs. I ⋮ Turan's theorem for \(k\)-graphs ⋮ Edmonds polytopes and a hierarchy of combinatorial problems ⋮ On a geometric combinatorial problem ⋮ Puncture sets