Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Equality in a matroidal circumference bound
Oxley
;
Royle
✭✭
0
Combinatorics
»
Matroid Theory
Gordon Royle
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Euler-Mascheroni constant
✭✭✭
0
Number Theory
»
Analytic N.T.
Juggernaut
Even vs. odd latin squares
Alon
;
Tarsi
✭✭✭
0
Combinatorics
mdevos
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Every metamonovalued funcoid is monovalued
Porton
✭✭
0
Topology
porton
Every metamonovalued reloid is monovalued
Porton
✭✭
0
Topology
porton
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Extension complexity of (convex) polygons
✭✭
0
Geometry
»
Polytopes
DOT
Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
Morrison
;
Noel
✭✭
0
Combinatorics
Jon Noel
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
Faithful cycle covers
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Fat 4-polytopes
Eppstein
;
Kuperberg
;
Ziegler
✭✭✭
0
Geometry
»
Polytopes
mdevos
Few subsequence sums in Z_n x Z_n
Bollobas
;
Leader
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
Graph Theory
jcmeyer
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Finite Lattice Representation Problem
✭✭✭✭
0
Algebra
williamdemeo
Fixed-point logic with counting
Blass
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
Graph Theory
David Wood
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Friendly partitions
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Frobenius number of four or more integers
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Funcoidal products inside an inward reloid
Porton
✭✭
0
Topology
porton
Fundamental group torsion for subsets of Euclidean 3-space
Ancient/folklore
✭✭
0
Topology
rybu
F_d versus F_{d+1}
Krajicek
✭✭✭
0
Logic
zitterbewegung
Gao's theorem for nonabelian groups
DeVos
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
General position subsets
Gowers
✭✭
0
Geometry
David Wood
Generalised Empty Hexagon Conjecture
Wood
✭✭
1
Geometry
David Wood
Generalized path-connectedness in proximity spaces
Porton
✭✭
0
Topology
porton
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
Agelos
Giuga's Conjecture on Primality
Giuseppe Giuga
✭✭
0
Number Theory
princeps
Goldbach conjecture
Goldbach
✭✭✭✭
0
Number Theory
»
Additive N.T.
Benschop
Goldberg's conjecture
Goldberg
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Graph Theory
»
Coloring
»
Labeling
DOT
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Graph product of multifuncoids
Porton
✭✭
0
Topology
porton
Graphs of exact colorings
✭✭
0
Algebra
sabisood
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Growth of finitely presented groups
Adyan
✭✭✭
0
Group Theory
mdevos
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
mohar
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
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