Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
subgraph
Graph Theory
»
Basic G.T.
Nearly spanning regular subgraphs
★★★
Author(s):
Alon
;
Mubayi
Conjecture
For every
and every positive integer
, there exists
so that every simple
-regular graph
with
has a
-regular subgraph
with
.
Keywords:
regular
;
subgraph
Posted by
mdevos
updated May 22nd, 2008
add new comment
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more