Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Graph Theory
»
Extremal G.T.
asp
Are almost all graphs determined by their spectrum?
✭✭✭
0
Graph Theory
mdevos
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
Are all Fermat Numbers square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there only finite Fermat Primes?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
Cores of Cayley graphs
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
The three 4-flows conjecture
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Real roots of the flow polynomial
Welsh
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Unit vector flows
Jain
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Packing T-joins
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Acyclic edge-colouring
Fiamcik
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
mdevos
The permanent conjecture
Kahn
✭✭
0
Combinatorics
»
Matrices
mdevos
The Alon-Tarsi basis conjecture
Alon
;
Linial
;
Meshulam
✭✭
0
Combinatorics
»
Matrices
mdevos
Olson's Conjecture
Olson
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Few subsequence sums in Z_n x Z_n
Bollobas
;
Leader
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
The Two Color Conjecture
Neumann-Lara
✭✭
0
Graph Theory
»
Directed Graphs
mdevos
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Antichains in the cycle continuous order
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Gao's theorem for nonabelian groups
DeVos
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
mohar
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
List colorings of edge-critical graphs
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
Robert Samal
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
Laplacian Degrees of a Graph
Guo
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
5-local-tensions
DeVos
✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
Weak pentagon problem
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Theoretical Comp. Sci.
»
Complexity
KWRegan
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
« 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