Repositorio de producción científica de la Universidad de Sevilla

The Size of a Graph Without Topological Complete Subgraphs

 

Advanced Search
 
Opened Access The Size of a Graph Without Topological Complete Subgraphs
Cites

Show item statistics
Icon
Export to
Author: Cera López, Martín
Diánez Martínez, Ana Rosa
Márquez Pérez, Alberto
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2000
Published in: SIAM J. Discrete Math., 13(3), 295–301 (2000)
Document type: Article
Abstract: In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil \frac{2n+5}{3}\right \rceil}\leq p < n$ we provide exact values for this function.
Size: 123.5Kb
Format: PDF

URI: http://hdl.handle.net/11441/34058

DOI: http://dx.doi.org/10.1137/S0895480197315941

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)