A note on color-bias Hamilton cycles in dense graphs

Research output: Contribution to journalArticlepeer-review

Standard

A note on color-bias Hamilton cycles in dense graphs. / Freschi, Andrea; Hyde, Joseph; Lada, Joanna; Treglown, Andrew.

In: SIAM Journal on Discrete Mathematics, Vol. 35, No. 2, 11.05.2021, p. 970-975.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Author

Freschi, Andrea ; Hyde, Joseph ; Lada, Joanna ; Treglown, Andrew. / A note on color-bias Hamilton cycles in dense graphs. In: SIAM Journal on Discrete Mathematics. 2021 ; Vol. 35, No. 2. pp. 970-975.

Bibtex

@article{bf729fba1975463a8e9293aef13e01f2,
title = "A note on color-bias Hamilton cycles in dense graphs",
abstract = "Balogh, Csaba, Jing, and Pluh{\'a}r [Electron. J. Combin., 27 (2020)] recently determined the minimum degree threshold that ensures a 2-colored graph $G$ contains a Hamilton cycle of significant color bias (i.e., a Hamilton cycle that contains significantly more than half of its edges in one color). In this short note we extend this result, determining the corresponding threshold for $r$-colorings.",
keywords = "Hamilton cycles, color-bias, discrepancy",
author = "Andrea Freschi and Joseph Hyde and Joanna Lada and Andrew Treglown",
year = "2021",
month = may,
day = "11",
doi = "10.1137/20M1378983",
language = "English",
volume = "35",
pages = "970--975",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

RIS

TY - JOUR

T1 - A note on color-bias Hamilton cycles in dense graphs

AU - Freschi, Andrea

AU - Hyde, Joseph

AU - Lada, Joanna

AU - Treglown, Andrew

PY - 2021/5/11

Y1 - 2021/5/11

N2 - Balogh, Csaba, Jing, and Pluhár [Electron. J. Combin., 27 (2020)] recently determined the minimum degree threshold that ensures a 2-colored graph $G$ contains a Hamilton cycle of significant color bias (i.e., a Hamilton cycle that contains significantly more than half of its edges in one color). In this short note we extend this result, determining the corresponding threshold for $r$-colorings.

AB - Balogh, Csaba, Jing, and Pluhár [Electron. J. Combin., 27 (2020)] recently determined the minimum degree threshold that ensures a 2-colored graph $G$ contains a Hamilton cycle of significant color bias (i.e., a Hamilton cycle that contains significantly more than half of its edges in one color). In this short note we extend this result, determining the corresponding threshold for $r$-colorings.

KW - Hamilton cycles

KW - color-bias

KW - discrepancy

UR - https://arxiv.org/abs/2011.03948

U2 - 10.1137/20M1378983

DO - 10.1137/20M1378983

M3 - Article

VL - 35

SP - 970

EP - 975

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -