Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
tchow
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Theoretical Comp. Sci.
»
Complexity
KWRegan
Inequality for square summable complex series
Retkes
✭✭
1
Analysis
tigris35711
The Riemann Hypothesis
Riemann
✭✭✭✭
0
Number Theory
»
Analytic N.T.
eric
Earth-Moon Problem
Ringel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Rota's unimodal conjecture
Rota
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Criterion for boundedness of power series
Rüdinger
✭
1
Analysis
andreasruedinger
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Graph Theory
»
Basic G.T.
andreasruedinger
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Graph Theory
»
Basic G.T.
»
Matchings
Jirka
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Cores of Cayley graphs
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Weak pentagon problem
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Schanuel's Conjecture
Schanuel
✭✭✭✭
0
Number Theory
»
Analytic N.T.
Charles
Bases of many weights
Schrijver
;
Seymour
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Order-invariant queries
Segoufin
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Faithful cycle covers
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Seagull problem
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
A discrete iteration related to Pierce expansions
Shallit
✭✭
1
Number Theory
shallit
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
ormeir
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
What is the homotopy type of the group of diffeomorphisms of the 4-sphere?
Smale
✭✭✭✭
0
Topology
rybu
Snevily's conjecture
Snevily
✭✭✭
1
Number Theory
»
Combinatorial N.T.
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Switching reconstruction conjecture
Stanley
✭✭
0
Graph Theory
fhavet
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Graph Theory
Eckhard Steffen
¿Are critical k-forests tight?
Strausz
✭✭
0
Graph Theory
»
Hypergraphs
Dino
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Graph Theory
»
Coloring
fhavet
Tarski's exponential function problem
Tarski
✭✭
0
Logic
Charles
Waring rank of determinant
Teitler
✭✭
0
Algebra
Zach Teitler
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
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