The Size of a Graph Without Topological Complete Subgraphs

dc.creator	Cera López, Martín
dc.creator	Diánez Martínez, Ana Rosa
dc.creator	Márquez Pérez, Alberto
dc.date.accessioned	2016-02-04T10:21:57Z
dc.date.available	2016-02-04T10:21:57Z
dc.date.issued	2000
dc.identifier.uri	http://hdl.handle.net/11441/34058
dc.description.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.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.relation.ispartof	SIAM J. Discrete Math., 13(3), 295–301 (2000)	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	extremal graph theory	es
dc.subject	topological complete subgraphs	es
dc.title	The Size of a Graph Without Topological Complete Subgraphs	es
dc.type	info:eu-repo/semantics/article	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)	es
dc.identifier.doi	http://dx.doi.org/10.1137/S0895480197315941	es
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/34058

Ficheros	Tamaño	Formato	Ver	Descripción
The size of a graph.pdf	123.5Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional