The size of a graph without topological complete subgraphs

Authors
Cera, M Dianez, A Marquez, A
Citation
M. Cera et al., The size of a graph without topological complete subgraphs, SIAM J DISC, 13(3), 2000, pp. 295-301
Citations number
7
Categorie Soggetti
Engineering Mathematics
Journal title
SIAM JOURNAL ON DISCRETE MATHEMATICS
ISSN journal
08954801 → ACNP
Volume
13
Issue
3
Year of publication
2000
Pages
295 - 301
Database
ISI
SICI code
0895-4801(2000)13:3<295:TSOAGW>2.0.ZU;2-5
Abstract
In this note we show a new upperbound for the function ex(n; TKp), i.e., th e maximum number of edges of a graph of order n not containing a subgraph h omeomorphic to the complete graph of order p. Further, for inverted right p erpendicular 2n+5/3 inverted left perpendicular less than or equal to p < n we provide exact values for this function.