Large Induced Subgraphs with All Degrees Odd
From MaRDI portal
Publication:4291193
DOI10.1017/S0963548300000389zbMath0793.05089MaRDI QIDQ4291193
Publication date: 5 May 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C15: Coloring of graphs and hypergraphs
Related Items
All trees contain a large induced subgraph having all degrees 1 (mod \(k\)), Every tree contains a large induced subgraph with all degrees odd