Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Sums of independent random variables with unbounded variance
Feige
✭✭
0
Theoretical Comp. Sci.
cwenner
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Graph Theory
»
Basic G.T.
andreasruedinger
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Distribution and upper bound of mimic numbers
Bhattacharyya
✭✭
1
Number Theory
»
Analytic N.T.
facility_cttb@i...
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
Graph Theory
David Wood
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
Partition of Complete Geometric Graph into Plane Trees
✭✭
0
Geometry
David Wood
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Fundamental group torsion for subsets of Euclidean 3-space
Ancient/folklore
✭✭
0
Topology
rybu
Friendly partitions
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Odd cycles and low oddness
✭✭
0
Graph Theory
Gagik
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Perfect 2-error-correcting codes over arbitrary finite alphabets.
✭✭
0
Combinatorics
»
Codes
davidcullen
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
Graph Theory
jcmeyer
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
Graph Theory
jcmeyer
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
Graph Theory
jcmeyer
Perfect cuboid
✭✭
0
Number Theory
»
Computational N.T.
tsihonglau
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
Transversal achievement game on a square grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
jfoniok
The 4x5 chessboard complex is the complement of a link, which link?
David Eppstein
✭✭
0
Topology
rybu
Lindelöf hypothesis
Lindelöf
✭✭
0
Number Theory
»
Analytic N.T.
porton
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Graph Theory
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Graph Theory
Robert Samal
Outer reloid of restricted funcoid
Porton
✭✭
0
Topology
porton
Sticky Cantor sets
✭✭
0
Topology
porton
Nonseparating planar continuum
✭✭
0
Topology
porton
Hilbert-Smith conjecture
David Hilbert
;
Paul A. Smith
✭✭
0
Topology
porton
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
Primitive pythagorean n-tuple tree
✭✭
0
Number Theory
tsihonglau
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Graph Theory
»
Coloring
»
Labeling
DOT
Covering a square with unit squares
✭✭
0
Geometry
Martin Erickson
Extension complexity of (convex) polygons
✭✭
0
Geometry
»
Polytopes
DOT
Matching cut and girth
✭✭
0
Graph Theory
w
Is Skewes' number e^e^e^79 an integer?
✭✭
0
Number Theory
»
Analytic N.T.
VladimirReshetnikov
Funcoidal products inside an inward reloid
Porton
✭✭
0
Topology
porton
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Upgrading a completary multifuncoid
Porton
✭✭
0
Topology
porton
Atomicity of the poset of completary multifuncoids
Porton
✭✭
0
Topology
porton
Atomicity of the poset of multifuncoids
Porton
✭✭
0
Topology
porton
Graph product of multifuncoids
Porton
✭✭
0
Topology
porton
« 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