A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909737234202624 |
|---|---|
| author | Lüchtrath, Lukas Mönch, Christian |
| author_facet | Lüchtrath, Lukas Mönch, Christian |
| contents | We provide a very elementary proof of a classical extremality result due to Sidorenko (Discrete Math. 131.1-3, 1994), which states that among all connected graphs $G$ on $k$ vertices, the $k$-vertex star maximises the number of graph homomorphisms of $G$ into any graph $H$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_01478 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A very short proof of Sidorenko's inequality for counts of homomorphism between graphs Lüchtrath, Lukas Mönch, Christian Combinatorics Probability 05C35 (Primary) 60C05 (Secondary) We provide a very elementary proof of a classical extremality result due to Sidorenko (Discrete Math. 131.1-3, 1994), which states that among all connected graphs $G$ on $k$ vertices, the $k$-vertex star maximises the number of graph homomorphisms of $G$ into any graph $H$. |
| title | A very short proof of Sidorenko's inequality for counts of homomorphism between graphs |
| topic | Combinatorics Probability 05C35 (Primary) 60C05 (Secondary) |
| url | https://arxiv.org/abs/2408.01478 |