Open Problem Garden
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
tchow
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Hilbert-Smith conjecture
David Hilbert
;
Paul A. Smith
✭✭
0
Topology
porton
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Imbalance conjecture
Kozerenko
✭✭
0
Graph Theory
Sergiy Kozerenko
Inequality for square summable complex series
Retkes
✭✭
1
Analysis
tigris35711
Inequality of the means
✭✭✭
0
Geometry
mdevos
Infinite distributivity of meet over join for a principal funcoid
Porton
✭✭
0
Topology
porton
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Inscribed Square Problem
Toeplitz
✭✭
0
Topology
dlh12
Invariant subspace problem
✭✭✭
0
Analysis
tchow
Inverse Galois Problem
Hilbert
✭✭✭✭
0
Group Theory
tchow
inverse of an integer matrix
Gregory
✭✭
0
Algebra
lvoyster
Is Skewes' number e^e^e^79 an integer?
✭✭
0
Number Theory
»
Analytic N.T.
VladimirReshetnikov
Is there an algorithm to determine if a triangulated 4-manifold is combinatorially equivalent to the 4-sphere?
Novikov
✭✭✭
0
Topology
rybu
Jacobian Conjecture
Keller
✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
cmlee
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Kneser–Poulsen conjecture
Kneser
;
Poulsen
✭✭✭
0
Geometry
tchow
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
Kriesell's Conjecture
Kriesell
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
Jon Noel
Laplacian Degrees of a Graph
Guo
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Length of surreal product
Gonshor
✭
1
Combinatorics
Lukáš Lánský
Lindelöf hypothesis
Lindelöf
✭✭
0
Number Theory
»
Analytic N.T.
porton
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Theoretical Comp. Sci.
»
Complexity
KWRegan
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Graph Theory
»
Coloring
berger
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
List colorings of edge-critical graphs
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
Robert Samal
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Graph Theory
»
Coloring
Jon Noel
Lonely runner conjecture
Cusick
;
Wills
✭✭✭
0
Number Theory
mdevos
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
Lovász Path Removal Conjecture
Lovasz
✭✭
0
Graph Theory
fhavet
Lucas Numbers Modulo m
✭✭
1
Number Theory
Martin Erickson
Magic square of squares
LaBar
✭✭
1
Number Theory
»
Computational N.T.
maxal
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
mdevos
Matching cut and girth
✭✭
0
Graph Theory
w
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Graph Theory
»
Basic G.T.
»
Matchings
Jirka
Melnikov's valency-variety problem
Melnikov
✭
0
Graph Theory
»
Coloring
»
Vertex coloring
asp
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
Navigate
more
Recent Activity
KPZ Universality Conjecture
3-Edge-Coloring Conjecture
Several ways to apply a (multivalued) multiargument function to a family of filters
Jones' conjecture
Multicolour Erdős--Hajnal Conjecture
more