On multicolor Turán numbers
The -blow-up of a given graph is obtained by replacing each edge by a clique of order where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the -blow-ups of any complete graph with order at most , respectively. We determ...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2024
|
| In: |
SIAM journal on discrete mathematics
Year: 2024, Volume: 38, Issue: 3, Pages: 2297-2311 |
| ISSN: | 1095-7146 |
| DOI: | 10.1137/24M1639488 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1137/24M1639488 Verlag, lizenzpflichtig, Volltext: https://epubs.siam.org/doi/10.1137/24M1639488 
|
| Author Notes: | József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison |
| Summary: | The -blow-up of a given graph is obtained by replacing each edge by a clique of order where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the -blow-ups of any complete graph with order at most , respectively. We determine the Turán number for the -blow-ups of a complete graph with order at least , completing the study of the extremal graphs for -blow-ups of complete graphs. |
|---|---|
| Item Description: | Gesehen am 25.06.2025 |
| Physical Description: | Online Resource |
| ISSN: | 1095-7146 |
| DOI: | 10.1137/24M1639488 |