The Size of a Graph Without Topological Complete Subgraphs

DOI10.1137/S0895480197315941MaRDI QIDQ4490786zbMATH OpenOpenAlexFDO

Authors Martín Cera, A. Diánez, A. Márquez

Publication date 20 July 2000

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480197315941

zbMATH Keywords

extremal graph theorytopological complete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Extremal Graphs without Topological Complete Subgraphs
• New exact values of the maximum size of graphs free of topological complete subgraphs
• Small topological complete subgraphs of ``dense graphs
• Graphs without minor complete subgraphs
• Covering a graph by topological complete subgraphs

Cited in

(6)

• Small topological complete subgraphs of ``dense graphs
• Covering a graph by topological complete subgraphs
• STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp)
• Extremal Graphs without Topological Complete Subgraphs
• An advance in infinite graph models for the analysis of transportation networks
• New exact values of the maximum size of graphs free of topological complete subgraphs

This page was built for publication: The Size of a Graph Without Topological Complete Subgraphs

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