Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Switching reconstruction conjecture
Stanley
✭✭
0
fhavet
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Eckhard Steffen
¿Are critical k-forests tight?
Strausz
✭✭
0
Hypergraphs
Dino
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Chords of longest cycles
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Directed Graphs
fhavet
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Basic G.T.
fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
The Crossing Number of the Complete Bipartite Graph
Turan
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Turán's problem for hypergraphs
Turan
✭✭
0
Hypergraphs
fhavet
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Triangle-packing vs triangle edge-transversal.
Tuza
✭✭
0
Extremal G.T.
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Coloring
»
Vertex coloring
fhavet
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Woodall's Conjecture
Woodall
✭✭✭
0
Directed Graphs
mdevos
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
fhavet
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
« first
‹ previous
1
2
3
4
5
Navigate
Subject
Algebra
(295)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Algebraic G.T.
(8)
Basic G.T.
(39)
Coloring
(65)
Directed Graphs
(26)
Extremal G.T.
(9)
Graph Algorithms
(3)
Hypergraphs
(5)
Infinite Graphs
(11)
Probabilistic G.T.
(3)
Topological G.T.
(18)
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
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more