Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Graceful Tree Conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Labeling
kintali
Twin prime conjecture
✭✭✭✭
0
Number Theory
kaushiks.nitt
Euler-Mascheroni constant
✭✭✭
0
Number Theory
»
Analytic N.T.
Juggernaut
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Choosability of Graph Powers
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Kriesell's Conjecture
Kriesell
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
Jon Noel
Partitioning the Projective Plane
Noel
✭✭
1
Geometry
Jon Noel
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Graph Theory
»
Coloring
Jon Noel
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Saturated $k$-Sperner Systems of Minimum Size
Morrison
;
Noel
;
Scott
✭✭
1
Combinatorics
»
Posets
Jon Noel
The Double Cap Conjecture
Kalai
✭✭
0
Combinatorics
Jon Noel
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Saturation in the Hypercube
Morrison
;
Noel
;
Scott
✭✭
0
Combinatorics
Jon Noel
Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
Morrison
;
Noel
✭✭
0
Combinatorics
Jon Noel
Turán Problem for $10$-Cycles in the Hypercube
Erdos
✭✭
0
Combinatorics
Jon Noel
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Graph Theory
»
Extremal G.T.
Jon Noel
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Graph Theory
»
Basic G.T.
»
Matchings
Jirka
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
jfoniok
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
Graph Theory
jcmeyer
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
Graph Theory
jcmeyer
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
Graph Theory
jcmeyer
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)
✭✭✭✭
0
Topology
Jailton Viana
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Total Colouring Conjecture
Behzad
✭✭✭
0
Graph Theory
»
Coloring
Iradmusa
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Graph Theory
Iradmusa
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Graph Theory
»
Coloring
Gordon Royle
Equality in a matroidal circumference bound
Oxley
;
Royle
✭✭
0
Combinatorics
»
Matroid Theory
Gordon Royle
Odd cycles and low oddness
✭✭
0
Graph Theory
Gagik
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
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