A note on internal partitions: the 5-regular case and beyond
From MaRDI portal
Publication:6121923
DOI10.1007/s00373-024-02774-9arXiv2109.14421OpenAlexW3204101637MaRDI QIDQ6121923
Pál Bärnkopf, Zoltán Paulovics, Zoltán Lóránt Nagy
Publication date: 26 March 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.14421
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular subgraphs of almost regular graphs
- Subgraphs of minimal degree \(k\)
- Satisfactory graph partition, variants, and generalizations
- The isoperimetric number of random regular graphs
- A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- Bounds on the bisection width for random \(d\)-regular graphs
- Internal Partitions of Regular Graphs
- Turán problems for integer-weighted graphs
- Approximating the minimum bisection size (extended abstract)
- Graph decomposition with constraints on the connectivity and minimum degree
- Extremal graphs with bounded densities of small subgraphs
- On the Edge-Expansion of Graphs
- On decomposition of triangle-free graphs under degree constraints
- Decomposing graphs with girth at least five under degree constraints
- Factors of IID on Trees
- Decomposing C4‐free graphs under degree constraints
- Friendly bisections of random graphs
This page was built for publication: A note on internal partitions: the 5-regular case and beyond
