The Size of a Graph Without Topological Complete Subgraphs

DOI10.1137/S0895480197315941zbMath0947.05045OpenAlexW2090594621MaRDI QIDQ4490786

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

Related Items (3)

New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ An advance in infinite graph models for the analysis of transportation networks ⋮ STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp)

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