Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
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
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
Graph Theory
azi
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
Graph Theory
fhavet
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Monadic second-order logic with cardinality predicates
Courcelle
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Monochromatic empty triangles
✭✭✭
0
Geometry
mdevos
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
Monotone 4-term Arithmetic Progressions
Davis
;
Entringer
;
Graham
;
Simmons
✭✭
0
Combinatorics
vjungic
MSO alternation hierarchy over pictures
Grandjean
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Nonseparating planar continuum
✭✭
0
Topology
porton
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
Graph Theory
David Wood
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Graph Theory
Andrew King
Odd cycles and low oddness
✭✭
0
Graph Theory
Gagik
Odd incongruent covering systems
Erdos
;
Selfridge
✭✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Odd perfect numbers
Ancient/folklore
✭✭✭
1
Number Theory
azi
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Olson's Conjecture
Olson
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
One-way functions exist
✭✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
porton
Order-invariant queries
Segoufin
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Outer reloid of restricted funcoid
Porton
✭✭
0
Topology
porton
Outward reloid of composition vs composition of outward reloids
Porton
✭✭
0
Topology
porton
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
Packing T-joins
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Partition of Complete Geometric Graph into Plane Trees
✭✭
0
Geometry
David Wood
Partitioning edge-connectivity
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
mdevos
Partitioning the Projective Plane
Noel
✭✭
1
Geometry
Jon Noel
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Pebbling a cartesian product
Graham
✭✭✭
0
Graph Theory
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Perfect 2-error-correcting codes over arbitrary finite alphabets.
✭✭
0
Combinatorics
»
Codes
davidcullen
Perfect cuboid
✭✭
0
Number Theory
»
Computational N.T.
tsihonglau
Petersen coloring conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Point sets with no empty pentagon
Wood
✭
1
Geometry
David Wood
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
Primitive pythagorean n-tuple tree
✭✭
0
Number Theory
tsihonglau
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Theory
»
Graph Algorithms
fhavet
« 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