New exact values of the maximum size of graphs free of topological complete subgraphs

DOI10.1016/j.disc.2006.07.031zbMath1122.05044OpenAlexW2035328755MaRDI QIDQ870962

A. Diánez, Martín Cera, Camino Balbuena, 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

zbMATH Keywords

extremal graphstopological compete graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Topological minors in bipartite graphs

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

This page was built for publication: New exact values of the maximum size of graphs free of topological complete subgraphs