Selective Graphs and Hypergraphs

DOI10.1016/S0167-5060(08)70506-5MaRDI QIDQ4163254zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, Vojtěch Rödl

Publication date 1978

Published in Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70506-5

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cited in

(7)

• Canonizing Ramsey theorems for finite graphs and hypergraphs
• Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. I
• Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. II
• Amalgamation of matroids and its applications
• A Ramsey type problem concerning vertex colourings
• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• Combinatorial partitions of finite posets and lattices - Ramsey lattices

This page was built for publication: Selective Graphs and Hypergraphs

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