Universal graphs without large bipartite subgraphs

DOI10.1112/S002557930001250XzbMath0551.05057OpenAlexW2166695258MaRDI QIDQ3344235

Péter Komjáth, János Pach

Publication date: 1984

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s002557930001250x

zbMATH Keywords

infinite graphsforbidden subgraphsuniversal graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Other combinatorial set theory (03E05)

Related Items (15)

Simplicial decompositions of graphs: A survey of applications ⋮ Some universal graphs ⋮ Universal graphs with a forbidden subtree ⋮ Chromatically optimal rigid graphs ⋮ Nonexistence of universal graphs without some trees ⋮ A note on classes of subgraphs of locally finite graphs ⋮ On the order of countable graphs ⋮ Universal elements and the complexity of certain classes of infinite graphs ⋮ Universality among graphs omitting a complete bipartite graph ⋮ Some remarks on universal graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Universal graphs with forbidden subgraphs and algebraic closure ⋮ Universal graphs omitting finitely many finite graphs ⋮ UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS ⋮ The complexity of a class of infinite graphs

Cites Work

• The axiom of constructibility. A guide for the mathematician
• Notes on combinatorial set theory

This page was built for publication: Universal graphs without large bipartite subgraphs