Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Decomposition of completions of reloids
Porton
✭✭
0
Topology
porton
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Decomposing eulerian graphs
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
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
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Davenport's constant
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Cube-Simplex conjecture
Kalai
✭✭✭
0
Geometry
»
Polytopes
mdevos
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Criterion for boundedness of power series
Rüdinger
✭
1
Analysis
andreasruedinger
Covering systems with big moduli
Erdos
;
Selfridge
✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Covering powers of cycles with equivalence subgraphs
✭
0
Graph Theory
Andrew King
Covering a square with unit squares
✭✭
0
Geometry
Martin Erickson
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Counterexamples to the Baillie-PSW primality test
✭✭
1
Number Theory
»
Computational N.T.
maxal
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Cores of Cayley graphs
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Convex uniform 5-polytopes
✭✭
1
Geometry
ACW
Convex Equipartitions with Extreme Perimeter
Nandakumar
✭✭
1
Geometry
Nandakumar
Convex 'Fair' Partitions Of Convex Polygons
Nandakumar
;
Ramana
✭✭
1
Geometry
Nandakumar
Continous analogue of Hirsch conjecture
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
»
Polytopes
deza
Consecutive non-orientable embedding obstructions
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Genus
Bruce Richter
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Combinatorial covering designs
Gordon
;
Mills
;
Rödl
;
Schönheim
✭
0
Combinatorics
»
Designs
Pseudonym
Colouring the square of a planar graph
Wegner
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Graph Theory
»
Coloring
fhavet
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Graph Theory
Eckhard Steffen
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular choosability of planar graphs
Mohar
✭
0
Graph Theory
»
Coloring
»
Homomorphisms
rosskang
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Graph Theory
»
Probabilistic G.T.
DOT
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
Chowla's cosine problem
Chowla
✭✭✭
0
Number Theory
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