Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Quartic rationally derived polynomials
Buchholz
;
MacDougall
✭✭✭
0
Number Theory
mdevos
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Random stable roommates
Mertens
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Real roots of the flow polynomial
Welsh
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
Rendezvous on a line
Alpern
✭✭✭
0
Unsorted
mdevos
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Rota's unimodal conjecture
Rota
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
S(S(f)) = S(f) for reloids
Porton
✭✭
0
Topology
porton
Saturated $k$-Sperner Systems of Minimum Size
Morrison
;
Noel
;
Scott
✭✭
1
Combinatorics
»
Posets
Jon Noel
Saturation in the Hypercube
Morrison
;
Noel
;
Scott
✭✭
0
Combinatorics
Jon Noel
Schanuel's Conjecture
Schanuel
✭✭✭✭
0
Number Theory
»
Analytic N.T.
Charles
Seagull problem
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Sets with distinct subset sums
Erdos
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Shannon capacity of the seven-cycle
✭✭✭
0
Graph Theory
tchow
Shuffle-Exchange Conjecture
Beneš
;
Folklore
;
Stone
✭✭✭
0
Combinatorics
Vadim Lioubimov
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Graph Theory
Vadim Lioubimov
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
Graph Theory
mdevos
Simplexity of the n-cube
✭✭✭
1
Geometry
mdevos
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
Slice-ribbon problem
Fox
✭✭✭✭
0
Topology
rybu
Smooth 4-dimensional Poincare conjecture
Poincare
;
Smale
;
Stallings
✭✭✭✭
0
Topology
rybu
Smooth 4-dimensional Schoenflies problem
Alexander
✭✭✭✭
0
Topology
rybu
Snevily's conjecture
Snevily
✭✭✭
1
Number Theory
»
Combinatorial N.T.
mdevos
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Graph Theory
Robert Samal
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Graph Theory
Robert Samal
Sticky Cantor sets
✭✭
0
Topology
porton
Strict inequalities for products of filters
Porton
✭
0
Topology
porton
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
arthur
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
berger
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