Note on regular subgraphs
✍ Scribed by R�dl, Vojtech; Wysocka, Beata
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 144 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Let f (n, γ) denote the largest integer r such that any graph G on n vertices with γn 2 edges contains an r-regular subgraph. In this paper we prove that
📜 SIMILAR VOLUMES
## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.
For any 4-regular graph G (possibly with multiple edges), we prove that, if the number N of distinct Euler orientations of G is such that N ≡ 1 (mod 3), then G has a 3-regular subgraph. It gives the new 4-regular graphs with multiple edges which have no 3-regular subgraphs, for which we know the num
## Abstract Berge conjectured that every finite simple 4‐regular graph __G__ contains a 3‐regular subgraph. We prove that this conjecture is true if the cyclic edge connectivity λ^__c__^(__G__) of __G__ is at least 10. Also we prove that if __G__ is a smallest counterexample, then λ^__c__^(__G__) i