Every graph contains a linearly sized induced subgraph with all degrees odd

Asaf Ferber, Michael Krivelevich

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that every graph G on n vertices with no isolated vertices contains an induced subgraph of size at least n/10000 with all degrees odd. This solves an old and well-known conjecture in graph theory.

Original languageEnglish
Article number108534
JournalAdvances in Mathematics
Volume406
DOIs
StatePublished - 17 Sep 2022

Keywords

  • Odd subgraphs

Fingerprint

Dive into the research topics of 'Every graph contains a linearly sized induced subgraph with all degrees odd'. Together they form a unique fingerprint.

Cite this