Induced Decompositions of Highly Dense Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Graph Theory Année : 2015

Induced Decompositions of Highly Dense Graphs

Résumé

Given two graphs F and G, an induced F -decomposition of G is a partition of E(G) into induced subgraphs isomorphic to F . Bondy and Szwarc-fiter [J. Graph Theory, DOI: 10.1002/jgt.21654] defined the value ex*(n, F) as the maximum number of edges in a graph of order n admitting an induced F -decomposition and determined the value of ex * (n, F) for some graphs (and families of graphs). In this paper we prove that ex * (n, F) = n 2 −o(n 2) is valid for all graphs F . We also present tighter asymptotic bounds for some of the small graphs for which the exact value of ex * remains unknown. The proofs are based on the heavy use of various classes of Kneser graphs and hypergraphs.
Fichier principal
Vignette du fichier
induced.pdf (285.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01076882 , version 1 (23-10-2014)

Identifiants

Citer

Nathann Cohen, Zsolt Tuza. Induced Decompositions of Highly Dense Graphs. Journal of Graph Theory, 2015, 78 (2), pp.97-107. ⟨10.1002/jgt.21792⟩. ⟨hal-01076882⟩
226 Consultations
266 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More