| KRÁĽ, Daniel, Jonathan A NOEL, Sergey NORIN, Jan VOLEC a Fan WEI. Non-Bipartite K-Common Graphs. COMBINATORICA. GERMANY: SPRINGER HEIDELBERG, 2022, roč. 42, č. 1, s. 87-114. ISSN 0209-9683. Dostupné z: https://dx.doi.org/10.1007/s00493-020-4499-9. |
Další formáty:
BibTeX
LaTeX
RIS
@article{2245132,
author = {Kráľ, Daniel and Noel, Jonathan A and Norin, Sergey and Volec, Jan and Wei, Fan},
article_location = {GERMANY},
article_number = {1},
doi = {http://dx.doi.org/10.1007/s00493-020-4499-9},
keywords = {common graphs; extremal combinatorics; Sidorenko's conjecture},
language = {eng},
issn = {0209-9683},
journal = {COMBINATORICA},
title = {Non-Bipartite K-Common Graphs},
url = {http://doi.org/10.1007/s00493-020-4499-9},
volume = {42},
year = {2022}
}
TY - JOUR
ID - 2245132
AU - Kráľ, Daniel - Noel, Jonathan A - Norin, Sergey - Volec, Jan - Wei, Fan
PY - 2022
TI - Non-Bipartite K-Common Graphs
JF - COMBINATORICA
VL - 42
IS - 1
SP - 87-114
EP - 87-114
PB - SPRINGER HEIDELBERG
SN - 02099683
KW - common graphs
KW - extremal combinatorics
KW - Sidorenko's conjecture
UR - http://doi.org/10.1007/s00493-020-4499-9
N2 - A graph H is k-common if the number of monochromatic copies of H in a k-edge-coloring of Kn is asymptotically minimized by a random coloring. For every k, we construct a connected non-bipartite k-common graph. This resolves a problem raised by Jagger, Štovíček and Thomason [20]. We also show that a graph H is k-common for every k if and only if H is Sidorenko and that H is locally k-common for every k if and only if H is locally Sidorenko.
ER -
KRÁĽ, Daniel, Jonathan A NOEL, Sergey NORIN, Jan VOLEC a Fan WEI. Non-Bipartite K-Common Graphs. \textit{COMBINATORICA}. GERMANY: SPRINGER HEIDELBERG, 2022, roč.~42, č.~1, s.~87-114. ISSN~0209-9683. Dostupné z: https://dx.doi.org/10.1007/s00493-020-4499-9.
|
