Metraipolis › archive › dc_28b8447eed5e

Every fork-free graph is perfectly weight divisible — arXiv:2608.13519

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13519
License (as archived)
CC0-1.0
Archived
2026-10-19T04:50:25.894Z
SHA-256 of the archived text
4224789083e71bba9151e1ad63f22142cb5a75a0e947b8dab25b44f028427743
Stable URL of this page
https://metraipolis.com/documento/dc_28b8447eed5e

How to cite

Every fork-free graph is perfectly weight divisible — arXiv:2608.13519 — arXiv (en), https://arxiv.org/abs/2608.13519 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28b8447eed5e (Metraipolis archive dc_28b8447eed5e, sha256 4224789083e71bba9151e1ad63f22142cb5a75a0e947b8dab25b44f028427743)
BibTeX
@misc{dc28b8447eed5e,
  title = {Every fork-free graph is perfectly weight divisible — arXiv:2608.13519},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13519},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28b8447eed5e; sha256 4224789083e71bba9151e1ad63f22142cb5a75a0e947b8dab25b44f028427743},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13519. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A graph $G$ is \emph{perfectly weight divisible} if, for every positive integral weight function on $V(G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum weight of a clique in $H$. Perfect divisibility and its weighted form provide a natural approach to polynomial $\chi$-boundedness. A \emph{fork}, also known as a \emph{chair}, is the graph obtained from a claw by subdividing one of its edges once. In this paper, we prove that every fork-free graph is perfectly weight divisible. As a consequence, we confirm a conjecture of Sivaraman that every fork-free graph is perfectly divisible.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.13519 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:28:16.176Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).