Extremal Graphs without Topological Complete Subgraphs

DOI10.1137/S0895480100378677zbMath1068.05032OpenAlexW1976919025MaRDI QIDQ4652645

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

Publication date: 28 February 2005

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

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

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 (2)

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

This page was built for publication: Extremal Graphs without Topological Complete Subgraphs