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

Asaf Ferber; Michael Krivelevich

doi:10.1016/j.aim.2022.108534

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

Asaf Ferber, Michael Krivelevich

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-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 language	English
Article number	108534
Journal	Advances in Mathematics
Volume	406
DOIs	https://doi.org/10.1016/j.aim.2022.108534
State	Published - 17 Sep 2022

Keywords

Odd subgraphs

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1016/j.aim.2022.108534

Cite this

@article{046999d0082c4a99a39267eefb579b18,

title = "Every graph contains a linearly sized induced subgraph with all degrees odd",

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.",

keywords = "Odd subgraphs",

author = "Asaf Ferber and Michael Krivelevich",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier Inc.",

year = "2022",

month = sep,

day = "17",

doi = "10.1016/j.aim.2022.108534",

language = "الإنجليزيّة",

volume = "406",

journal = "Advances in Mathematics",

issn = "0001-8708",

publisher = "Academic Press Inc.",

}

TY - JOUR

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

AU - Ferber, Asaf

AU - Krivelevich, Michael

PY - 2022/9/17

Y1 - 2022/9/17

N2 - 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.

AB - 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.

KW - Odd subgraphs

UR - http://www.scopus.com/inward/record.url?scp=85132867757&partnerID=8YFLogxK

U2 - 10.1016/j.aim.2022.108534

DO - 10.1016/j.aim.2022.108534

M3 - مقالة

SN - 0001-8708

VL - 406

JO - Advances in Mathematics

JF - Advances in Mathematics

M1 - 108534

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this