A generalization of Petersen's theorem
✍ Scribed by Michel X. Goemans
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 338 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Goemans, M.X., A generalization of Petersen's theorem, Discrete Mathematics 115 (1993) 277-282. Petersen's theorem asserts that any cubic graph with at most 2 cut edges has a perfect matching. We generalize this classical result by showing that any cubic graph G = (V, E) with at most 1 cut edge has a T-join of cardinality less than or equal to ( VI/2 for every even subset T of vertices. Our result is based on the Edmonds-Johnson min-max relation for T-joins.
In his 1891 landmark paper on the factorization of regular graphs, Petersen [6] (see Biggs et al. [l]) proved the following famous result.
📜 SIMILAR VOLUMES
## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__
Let 9 be the polyhedron given by 9 = {x E R": Nx=O, a~x~b}, where N is a totally unimodular matrix and a and 6 are any integral vectors. For x E R" let (x)' denote the vector obtained from x by changing all its negative components to zeros. Let x1, . . . , xp be the integral points in 9 and let 9+ b
The following theorem is lproved. If the sets VI, . . . , Vn+, CR" and a E fly:: conv Vi, then there exist elements ui E Vi (i = 1, . . . , n + 1) such that a E conv{o,, . . . , un+J. Thii is a generalization of Carathtidory's theorem. By applying this and similar results some open questions are ans