Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Burr, S. A.
Graph Theory
»
Directed Graphs
Oriented trees in n-chromatic digraphs
★★★
Author(s):
Burr
Conjecture
Every digraph with chromatic number at least
contains every oriented tree of order
as a subdigraph.
Keywords:
Posted by
fhavet
updated February 25th, 2013
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