机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAEL
Alon, N
[1
]
Fischer, E
论文数: 0引用数: 0
h-index: 0
机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAEL
Fischer, E
[1
]
机构:
[1] TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAEL
A conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n.
机构:
Southern Polytech State Univ, Dept Math, Marietta, GA USASouthern Polytech State Univ, Dept Math, Marietta, GA USA
Vandenbussche, Jennifer
West, Douglas B.
论文数: 0引用数: 0
h-index: 0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua, Peoples R China
Univ Illinois, Urbana, IL 61801 USASouthern Polytech State Univ, Dept Math, Marietta, GA USA
West, Douglas B.
[J].
ELECTRONIC JOURNAL OF COMBINATORICS,
2013,
20
(03):