A result on large induced subgraphs with prescribed residues in bipartite graphs

DOI10.37236/11454OpenAlexW4318313725MaRDI QIDQ2684886

Zach Hunter

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.00296

zbMATH Keywords

Scott's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Random walks on graphs (05C81)

Related Items (1)

An asymptotically tight lower bound for superpatterns with small alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• On induced subgraphs with odd degrees
• Zero-sum partition theorems for graphs
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Large Induced Subgraphs with All Degrees Odd
• On induced subgraphs with all degree odd
• A counterexample to the lights out problem

This page was built for publication: A result on large induced subgraphs with prescribed residues in bipartite graphs