Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Graph Theory
»
Coloring
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Dense rational distance sets in the plane
Ulam
✭✭✭
0
Geometry
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Jacobian Conjecture
Keller
✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Algebraic independence of pi and e
✭✭✭
0
Number Theory
porton
Schanuel's Conjecture
Schanuel
✭✭✭✭
0
Number Theory
»
Analytic N.T.
Charles
Tarski's exponential function problem
Tarski
✭✭
0
Logic
Charles
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
The Hodge Conjecture
Hodge
✭✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Wide partition conjecture
Chow
;
Taylor
✭✭
0
Combinatorics
tchow
Kneser–Poulsen conjecture
Kneser
;
Poulsen
✭✭✭
0
Geometry
tchow
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Edge list coloring conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
tchow
Discrete Logarithm Problem
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cplxphil
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Goldberg's conjecture
Goldberg
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Edge-antipodal colorings of cubes
Norine
✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Termination of the sixth Goodstein Sequence
Graham
✭
0
Logic
mdevos
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
Monochromatic empty triangles
✭✭✭
0
Geometry
mdevos
trace inequality
✭✭
0
Algebra
Miwa Lin
Inverse Galois Problem
Hilbert
✭✭✭✭
0
Group Theory
tchow
Elementary symmetric of a sum of matrices
✭✭✭
0
Algebra
rscosa
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Invariant subspace problem
✭✭✭
0
Analysis
tchow
Shannon capacity of the seven-cycle
✭✭✭
0
Graph Theory
tchow
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
Sums of independent random variables with unbounded variance
Feige
✭✭
0
Theoretical Comp. Sci.
cwenner
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
Inequality of the means
✭✭✭
0
Geometry
mdevos
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
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Twin prime conjecture
✭✭✭✭
0
Number Theory
kaushiks.nitt
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
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