Equivalent Subgraphs of Order $3$

Tomoki Nakamigawa 1
1 Department of Information Science
Abstract : It is proved that any graph of order $14n/3 + O(1)$ contains a family of n induced subgraphs of order $3$ such that they are vertex-disjoint and equivalent to each other.
Keywords : graph Ramsey theory graph decomposition
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.289-292, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01184449
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 14:59:29
Dernière modification le : jeudi 11 mai 2017 - 01:02:51
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 11:14:15

Fichier

dmAE0157.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184449, version 1

Collections

INSMI | TDS-MACS

Citation

Tomoki Nakamigawa. Equivalent Subgraphs of Order $3$. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.289-292, 2005, DMTCS Proceedings. 〈hal-01184449〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

319

Téléchargements de fichiers

121

Contact


archive-ouverte@inria.fr