Topological Cliques in Graphs

DOI10.1017/S0963548300001140zbMath0809.05080OpenAlexW4250021881MaRDI QIDQ4305319

János Komlós

Publication date: 20 March 1995

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001140

zbMATH Keywords

subdivisionrandom graphexpandertopological clique

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (18)

Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Rainbow subdivisions of cliques ⋮ On nowhere dense graphs ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Boxicity, poset dimension, and excluded minors ⋮ Logarithmically small minors and topological minors ⋮ Highly linked graphs ⋮ Subdivisions of a large clique in \(C_6\)-free graphs

Cites Work

• Topological cliques of random graphs
• On the conjecture of Hajos
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind

This page was built for publication: Topological Cliques in Graphs