Hamiltonicity and structure of connected biclaw-free graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911045276139520 |
|---|---|
| author | Pokrovskiy, Alexey Yang, Xiaoan |
| author_facet | Pokrovskiy, Alexey Yang, Xiaoan |
| contents | We show that for sufficiently large $d$, every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05836 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonicity and structure of connected biclaw-free graphs Pokrovskiy, Alexey Yang, Xiaoan Combinatorics 05C45 G.2.2 We show that for sufficiently large $d$, every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li. |
| title | Hamiltonicity and structure of connected biclaw-free graphs |
| topic | Combinatorics 05C45 G.2.2 |
| url | https://arxiv.org/abs/2507.05836 |