Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Are there only finite Fermat Primes?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Graph Theory
»
Basic G.T.
andreasruedinger
Atomicity of the poset of completary multifuncoids
Porton
✭✭
0
Topology
porton
Atomicity of the poset of multifuncoids
Porton
✭✭
0
Topology
porton
Average diameter of a bounded cell of a simple arrangement
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
deza
Barnette's Conjecture
Barnette
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Bases of many weights
Schrijver
;
Seymour
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Beneš Conjecture
Beneš
✭✭✭
0
Combinatorics
Vadim Lioubimov
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Graph Theory
Vadim Lioubimov
Big Line or Big Clique in Planar Point Sets
Kara
;
Por
;
Wood
✭✭
1
Geometry
David Wood
Birch & Swinnerton-Dyer conjecture
✭✭✭✭
0
Number Theory
eyoong
Blatter-Specker Theorem for ternary relations
Makowsky
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
Graph Theory
David Wood
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Burnside problem
Burnside
✭✭✭✭
0
Group Theory
dlh12
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Choosability of Graph Powers
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Chords of longest cycles
Thomassen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Chowla's cosine problem
Chowla
✭✭✭
0
Number Theory
mdevos
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Graph Theory
»
Probabilistic G.T.
DOT
Circular choosability of planar graphs
Mohar
✭
0
Graph Theory
»
Coloring
»
Homomorphisms
rosskang
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
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
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Graph Theory
»
Coloring
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Combinatorial covering designs
Gordon
;
Mills
;
Rödl
;
Schönheim
✭
0
Combinatorics
»
Designs
Pseudonym
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
Consecutive non-orientable embedding obstructions
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Genus
Bruce Richter
Continous analogue of Hirsch conjecture
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
»
Polytopes
deza
Convex 'Fair' Partitions Of Convex Polygons
Nandakumar
;
Ramana
✭✭
1
Geometry
Nandakumar
Convex Equipartitions with Extreme Perimeter
Nandakumar
✭✭
1
Geometry
Nandakumar
Convex uniform 5-polytopes
✭✭
1
Geometry
ACW
Cores of Cayley graphs
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
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