Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Bermond, Jean-Claude
Graph Theory
»
Directed Graphs
The Bermond-Thomassen Conjecture
★★
Author(s):
Bermond
;
Thomassen
Conjecture
For every positive integer
, every digraph with minimum out-degree at least
contains
disjoint cycles.
Keywords:
cycles
Posted by
JS
updated October 1st, 2007
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