Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Waring rank of determinant
Teitler
✭✭
0
Algebra
Zach Teitler
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Graph Theory
»
Topological G.T.
»
Planar graphs
mdevos
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Theoretical Comp. Sci.
»
Complexity
KWRegan
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
Agelos
Divisibility of central binomial coefficients
Graham
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
A sextic counterexample to Euler's sum of powers conjecture
Euler
✭✭
1
Number Theory
»
Computational N.T.
maxal
Counterexamples to the Baillie-PSW primality test
✭✭
1
Number Theory
»
Computational N.T.
maxal
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Big Line or Big Clique in Planar Point Sets
Kara
;
Por
;
Wood
✭✭
1
Geometry
David Wood
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Graph Theory
»
Basic G.T.
»
Matchings
Jirka
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Snevily's conjecture
Snevily
✭✭✭
1
Number Theory
»
Combinatorial N.T.
mdevos
MacEachen Conjecture
McEachen
✭
1
Number Theory
billymac00
Convex 'Fair' Partitions Of Convex Polygons
Nandakumar
;
Ramana
✭✭
1
Geometry
Nandakumar
End-Devouring Rays
Georgakopoulos
✭
1
Graph Theory
»
Infinite Graphs
Agelos
A discrete iteration related to Pierce expansions
Shallit
✭✭
1
Number Theory
shallit
Simplexity of the n-cube
✭✭✭
1
Geometry
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
tchow
Odd perfect numbers
Ancient/folklore
✭✭✭
1
Number Theory
azi
Diophantine quintuple conjecture
✭✭
1
Number Theory
maxal
Magic square of squares
LaBar
✭✭
1
Number Theory
»
Computational N.T.
maxal
Frobenius number of four or more integers
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
Graph Theory
David Wood
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
David Wood
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Criterion for boundedness of power series
Rüdinger
✭
1
Analysis
andreasruedinger
Distribution and upper bound of mimic numbers
Bhattacharyya
✭✭
1
Number Theory
»
Analytic N.T.
facility_cttb@i...
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
Are there an infinite number of lucky primes?
Lazarus: Gardiner: Metropolis
;
Ulam
✭
1
Number Theory
»
Additive N.T.
cubola zaruka
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Transversal achievement game on a square grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
arthur
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Graph Theory
Robert Samal
Point sets with no empty pentagon
Wood
✭
1
Geometry
David Wood
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Graph Theory
Iradmusa
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Graph Theory
Andrew King
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Lucas Numbers Modulo m
✭✭
1
Number Theory
Martin Erickson
« 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