Universal graphs without large bipartite subgraphs

DOI10.1112/S002557930001250XMaRDI QIDQ3344235zbMATH OpenOpenAlexFDO

Authors 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

forbidden subgraphsinfinite graphsuniversal graph

Mathematics Subject Classification ID

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

Recommendations

• Universal graphs without large bipartite graphs assuming GCH
• On universal graphs with forbidden topological subgraphs
• Universal graphs without large cliques
• Universality among graphs omitting a complete bipartite graph
• Some universal graphs

Cites work

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

Cited in

(25)

• On universal graphs with forbidden topological subgraphs
• Simplicial decompositions of graphs: A survey of applications
• Some universal graphs
• Chromatically optimal rigid graphs
• Universal elements and the complexity of certain classes of infinite graphs
• Universal graphs with forbidden subgraphs and algebraic closure
• The complexity of a class of infinite graphs
• Nonexistence of universal graphs without some trees
• On the order of countable graphs
• Universal graphs without large bipartite graphs assuming GCH
• Universal graphs without large cliques
• Universality among graphs omitting a complete bipartite graph
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Graphs without a partition into two proportionally dense subgraphs
• Partitioning subgraphs of profinite ordered graphs
• Universal graphs omitting finitely many finite graphs
• On universal positive graphs
• Universal graphs and universal permutations
• scientific article; zbMATH DE number 5720940 (Why is no real title available?)
• Universal infinite clique-omitting graphs
• Some remarks on universal graphs
• A note on classes of subgraphs of locally finite graphs
• The Erdős-Hajnal problem list
• Small universal families for graphs omitting cliques without GCH
• Universal graphs with a forbidden subtree

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

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