Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Fixed-point logic with counting
Blass
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Finite Lattice Representation Problem
✭✭✭✭
0
Algebra
williamdemeo
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
Graph Theory
jcmeyer
Few subsequence sums in Z_n x Z_n
Bollobas
;
Leader
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Fat 4-polytopes
Eppstein
;
Kuperberg
;
Ziegler
✭✭✭
0
Geometry
»
Polytopes
mdevos
Faithful cycle covers
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
Morrison
;
Noel
✭✭
0
Combinatorics
Jon Noel
Extension complexity of (convex) polygons
✭✭
0
Geometry
»
Polytopes
DOT
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
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
Every metamonovalued reloid is monovalued
Porton
✭✭
0
Topology
porton
Every metamonovalued funcoid is monovalued
Porton
✭✭
0
Topology
porton
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Even vs. odd latin squares
Alon
;
Tarsi
✭✭✭
0
Combinatorics
mdevos
Euler-Mascheroni constant
✭✭✭
0
Number Theory
»
Analytic N.T.
Juggernaut
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Equality in a matroidal circumference bound
Oxley
;
Royle
✭✭
0
Combinatorics
»
Matroid Theory
Gordon Royle
End-Devouring Rays
Georgakopoulos
✭
1
Graph Theory
»
Infinite Graphs
Agelos
Elementary symmetric of a sum of matrices
✭✭✭
0
Algebra
rscosa
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
Edge-antipodal colorings of cubes
Norine
✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Edge list coloring conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
tchow
Earth-Moon Problem
Ringel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
Graph Theory
fhavet
Divisibility of central binomial coefficients
Graham
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Distribution and upper bound of mimic numbers
Bhattacharyya
✭✭
1
Number Theory
»
Analytic N.T.
facility_cttb@i...
Discrete Logarithm Problem
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cplxphil
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Direct proof of a theorem about compact funcoids
Porton
✭✭
0
Topology
porton
Dirac's Conjecture
Dirac
✭✭
0
Geometry
David Wood
Diophantine quintuple conjecture
✭✭
1
Number Theory
maxal
Ding's tau_r vs. tau conjecture
Ding
✭✭✭
0
Combinatorics
»
Optimization
mdevos
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Dense rational distance sets in the plane
Ulam
✭✭✭
0
Geometry
mdevos
« 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