Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there infinite number of Mersenne Primes?
✭✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Growth of finitely presented groups
Adyan
✭✭✭
0
Group Theory
mdevos
Strong matchings and covers
Aharoni
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
berger
Aharoni-Berger conjecture
Aharoni
;
Berger
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Theory
»
Graph Algorithms
fhavet
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Alexa's Conjecture on Primality
Alexa
✭✭
0
Number Theory
princeps
Smooth 4-dimensional Schoenflies problem
Alexander
✭✭✭✭
0
Topology
rybu
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
The Alon-Tarsi basis conjecture
Alon
;
Linial
;
Meshulam
✭✭
0
Combinatorics
»
Matrices
mdevos
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Even vs. odd latin squares
Alon
;
Tarsi
✭✭✭
0
Combinatorics
mdevos
Rendezvous on a line
Alpern
✭✭✭
0
Unsorted
mdevos
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Graph Theory
Andrew King
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Graph Theory
»
Probabilistic G.T.
DOT
Odd perfect numbers
Ancient/folklore
✭✭✭
1
Number Theory
azi
Which homology 3-spheres bound homology 4-balls?
Ancient/folklore
✭✭✭✭
0
Topology
rybu
Fundamental group torsion for subsets of Euclidean 3-space
Ancient/folklore
✭✭
0
Topology
rybu
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Graph Theory
»
Coloring
»
Labeling
DOT
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
arthur
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
Vertex Cover Integrality Gap
Atserias
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
Graph Theory
azi
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Barnette's Conjecture
Barnette
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Total Colouring Conjecture
Behzad
✭✭✭
0
Graph Theory
»
Coloring
Iradmusa
The robustness of the tensor product
Ben-Sasson
;
Sudan
✭✭✭
0
Theoretical Comp. Sci.
»
Coding Theory
ormeir
Beneš Conjecture
Beneš
✭✭✭
0
Combinatorics
Vadim Lioubimov
« 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