On Vizing’s problem for triangle-free graphs
| Authors |
|
|---|---|
| Publication date | 2025 |
| Journal | Electronic Journal of Combinatorics |
| Article number | P4.3 |
| Volume | Issue number | 32 | 4 |
| Number of pages | 12 |
| Organisations |
|
| Abstract |
We prove that (Formula presented) for any triangle-free graph G of maximum degree ∆ provided ∆ ⩾ 524. This gives tangible progress towards an old problem of Vizing, in a form cast by Reed. We use a method of Hurley and Pirot, which in turn relies on a new counting argument of the second author. |
| Document type | Article |
| Note | Publisher Copyright: © The authors. |
| Language | English |
| Published at | https://doi.org/10.37236/12703 |
| Other links | https://www.scopus.com/pages/publications/105018783017 |
| Downloads |
12703-PDF file-56982-2-10-20251003
(Final published version)
|
| Permalink to this page | |