Edge mappings of graphs: Ramsey type parameters
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911769575817216 |
|---|---|
| author | Caro, Yair Patkós, Balázs Tuza, Zsolt Vizer, Máté |
| author_facet | Caro, Yair Patkós, Balázs Tuza, Zsolt Vizer, Máté |
| contents | In this paper, we address problems related to parameters concerning edge mappings of graphs. Inspired by Ramsey's Theorem, the quantity $m(G, H)$ is defined to be the minimum number $n$ such that for every $f: E(K_n) \rightarrow E(K_n)$ either there is a fixed copy of $G$ with $f ( e) = e$ for all $e\in E(G)$, or a free copy of $H$ with $f( e) \notin E(H)$ for all $e\in E(H)$. We extend many old results from the 80's as well as proving many new results. We also consider several new interesting parameters with the same spirit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_01004 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Edge mappings of graphs: Ramsey type parameters Caro, Yair Patkós, Balázs Tuza, Zsolt Vizer, Máté Combinatorics In this paper, we address problems related to parameters concerning edge mappings of graphs. Inspired by Ramsey's Theorem, the quantity $m(G, H)$ is defined to be the minimum number $n$ such that for every $f: E(K_n) \rightarrow E(K_n)$ either there is a fixed copy of $G$ with $f ( e) = e$ for all $e\in E(G)$, or a free copy of $H$ with $f( e) \notin E(H)$ for all $e\in E(H)$. We extend many old results from the 80's as well as proving many new results. We also consider several new interesting parameters with the same spirit. |
| title | Edge mappings of graphs: Ramsey type parameters |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.01004 |