Extremal Graphs without Topological Complete Subgraphs

DOI10.1137/S0895480100378677MaRDI QIDQ4652645zbMATH OpenOpenAlexFDO

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

Recommendations

• The Size of a Graph Without Topological Complete Subgraphs
• New exact values of the maximum size of graphs free of topological complete subgraphs
• Graphs without minor complete subgraphs
• Covering a graph by topological complete subgraphs
• Turán's problem for trees

Cited in

(6)

• Extremal graphs having no stable cutset
• scientific article; zbMATH DE number 4139791 (Why is no real title available?)
• Extremal Graphs without Large Forbidden Subgraphs
• The Size of a Graph 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: Extremal Graphs without Topological Complete Subgraphs

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