Metraipolis › archive › dc_cfb47863e53c

Degeneracy: From Graphs to Matroids — arXiv:2608.09655

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09655
License (as archived)
CC0-1.0
Archived
2026-10-19T09:09:05.111Z
SHA-256 of the archived text
a9cc7f6dca3d890a6a63358c3c1a2e6d9b5a0fb2c40aa8f75035cce8d2cb13a2
Stable URL of this page
https://metraipolis.com/documento/dc_cfb47863e53c

How to cite

Degeneracy: From Graphs to Matroids — arXiv:2608.09655 — arXiv (en), https://arxiv.org/abs/2608.09655 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cfb47863e53c (Metraipolis archive dc_cfb47863e53c, sha256 a9cc7f6dca3d890a6a63358c3c1a2e6d9b5a0fb2c40aa8f75035cce8d2cb13a2)
BibTeX
@misc{dccfb47863e53c,
  title = {Degeneracy: From Graphs to Matroids — arXiv:2608.09655},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09655},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cfb47863e53c; sha256 a9cc7f6dca3d890a6a63358c3c1a2e6d9b5a0fb2c40aa8f75035cce8d2cb13a2},
  year = {2026}
}

Archived text

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

A graph is $k$-degenerate if every subgraph has a vertex of degree at most $k$. We extend this notion to matroids, defining a loopless matroid $M$ to be $k$-degenerate if every restriction of $M$ contains a cocircuit of size at most $k$; $M$ is minimally $k$-degenerate if it has cogirth $k$ and every proper restriction of $M$ has cogirth at most $k-1$. Our main result characterizes extremal minimally $k$-degenerate matroids. We also extend the known arboricity bound for matroids, showing that $k$-degenerate matroids have arboricity at most $k$ and providing sharper bounds.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.09655 — 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-19T09:05:33.589Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).