Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
Olson's Conjecture
Olson
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Is there an algorithm to determine if a triangulated 4-manifold is combinatorially equivalent to the 4-sphere?
Novikov
✭✭✭
0
Topology
rybu
Edge-antipodal colorings of cubes
Norine
✭✭
0
Combinatorics
»
Ramsey Theory
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
Partitioning the Projective Plane
Noel
✭✭
1
Geometry
Jon Noel
The Two Color Conjecture
Neumann-Lara
✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Convex 'Fair' Partitions Of Convex Polygons
Nandakumar
;
Ramana
✭✭
1
Geometry
Nandakumar
Convex Equipartitions with Extreme Perimeter
Nandakumar
✭✭
1
Geometry
Nandakumar
Saturated $k$-Sperner Systems of Minimum Size
Morrison
;
Noel
;
Scott
✭✭
1
Combinatorics
»
Posets
Jon Noel
Saturation in the Hypercube
Morrison
;
Noel
;
Scott
✭✭
0
Combinatorics
Jon Noel
Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
Morrison
;
Noel
✭✭
0
Combinatorics
Jon Noel
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Graph Theory
»
Extremal G.T.
Jon Noel
Universal point sets for planar graphs
Mohar
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
mohar
List colorings of edge-critical graphs
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
Robert Samal
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Circular choosability of planar graphs
Mohar
✭
0
Graph Theory
»
Coloring
»
Homomorphisms
rosskang
Random stable roommates
Mertens
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Melnikov's valency-variety problem
Melnikov
✭
0
Graph Theory
»
Coloring
»
Vertex coloring
asp
MacEachen Conjecture
McEachen
✭
1
Number Theory
billymac00
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Blatter-Specker Theorem for ternary relations
Makowsky
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Lovász Path Removal Conjecture
Lovasz
✭✭
0
Graph Theory
fhavet
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Lindelöf hypothesis
Lindelöf
✭✭
0
Number Theory
»
Analytic N.T.
porton
Are there an infinite number of lucky primes?
Lazarus: Gardiner: Metropolis
;
Ulam
✭
1
Number Theory
»
Additive N.T.
cubola zaruka
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Magic square of squares
LaBar
✭✭
1
Number Theory
»
Computational N.T.
maxal
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Kriesell's Conjecture
Kriesell
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
Jon Noel
F_d versus F_{d+1}
Krajicek
✭✭✭
0
Logic
zitterbewegung
Imbalance conjecture
Kozerenko
✭✭
0
Graph Theory
Sergiy Kozerenko
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Kneser–Poulsen conjecture
Kneser
;
Poulsen
✭✭✭
0
Geometry
tchow
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
cmlee
Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere?
Kirby
✭✭✭
0
Topology
rybu
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
« 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