Equivalent Subgraphs of Order $3$

Tomoki Nakamigawa

doi:10.46298/dmtcs.3460

Equivalent Subgraphs of Order $3$

dmtcs:3460 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3460

Equivalent Subgraphs of Order $3$ Conference paper

Authors: Tomoki Nakamigawa ¹

1 Department of Information Science

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.

https://doi.org/10.46298/dmtcs.3460

Source: HAL:hal-01184449v1

Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Section: Proceedings

Published on: January 1, 2005

Imported on: May 10, 2017

Keywords: graph Ramsey theory,graph decomposition,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Equivalent Subgraphs of Order $3$

Bibliographic References

Share and export

Consultation statistics

Tomoki Nakamigawa - Equivalent Subgraphs of Order 33

Bibliographic References

Share and export

Consultation statistics

Equivalent Subgraphs of Order $3$