New exact values of the maximum size of graphs free of topological complete subgraphs
From MaRDI portal
Publication:870962
DOI10.1016/j.disc.2006.07.031zbMath1122.05044MaRDI QIDQ870962
Camino Balbuena, A. Diánez, Martín Cera, Pedro García-Vázquez
Publication date: 15 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.031
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
- Homomorphism theorems for graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Topological Cliques in Graphs
- The Size of a Graph Without Topological Complete Subgraphs
- Extremal Graphs without Topological Complete Subgraphs
- On Representatives of Subsets
- Topological cliques in graphs II
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind