Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
configure
David Wood
view
track
contact
Type
Post
Author
Replies
Last post
Open problem
Partition of Complete Geometric Graph into Plane Trees
David Wood
1
1 year 47 weeks ago
Open problem
Book Thickness of Subdivisions
David Wood
1
2 years 21 weeks ago
Open problem
3-Colourability of Arrangements of Great Circles
David Wood
2
3 years 6 weeks ago
Open problem
Jones' conjecture
cmlee
3
4 years 1 day ago
Open problem
Point sets with no empty pentagon
David Wood
2
4 years 36 weeks ago
Open problem
Chromatic number of associahedron
David Wood
0
8 years 26 weeks ago
Open problem
Chromatic Number of Common Graphs
David Wood
0
9 years 16 weeks ago
Open problem
List Hadwiger Conjecture
David Wood
0
9 years 21 weeks ago
Open problem
Geometric Hales-Jewett Theorem
David Wood
0
9 years 36 weeks ago
Open problem
Generalised Empty Hexagon Conjecture
David Wood
0
9 years 36 weeks ago
Open problem
Nonrepetitive colourings of planar graphs
David Wood
0
9 years 36 weeks ago
Open problem
General position subsets
David Wood
0
9 years 36 weeks ago
Open problem
Colouring $d$-degenerate graphs with large girth
David Wood
0
9 years 37 weeks ago
Open problem
Forcing a 2-regular minor
David Wood
0
9 years 37 weeks ago
Open problem
Fractional Hadwiger
David Wood
0
9 years 37 weeks ago
Open problem
Dirac's Conjecture
David Wood
0
9 years 45 weeks ago
Open problem
Big Line or Big Clique in Planar Point Sets
David Wood
1
11 years 10 weeks ago
Open problem
Forcing a $K_6$-minor
David Wood
0
11 years 46 weeks ago
Open problem
Edge-Colouring Geometric Complete Graphs
David Wood
0
14 years 7 weeks ago
Open problem
Number of Cliques in Minor-Closed Classes
David Wood
0
14 years 8 weeks ago
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