Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
Sets with distinct subset sums
Erdos
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Seagull problem
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Schanuel's Conjecture
Schanuel
✭✭✭✭
0
Number Theory
»
Analytic N.T.
Charles
Saturation in the Hypercube
Morrison
;
Noel
;
Scott
✭✭
0
Combinatorics
Jon Noel
Saturated $k$-Sperner Systems of Minimum Size
Morrison
;
Noel
;
Scott
✭✭
1
Combinatorics
»
Posets
Jon Noel
S(S(f)) = S(f) for reloids
Porton
✭✭
0
Topology
porton
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
Rota's unimodal conjecture
Rota
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Rendezvous on a line
Alpern
✭✭✭
0
Unsorted
mdevos
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Real roots of the flow polynomial
Welsh
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Random stable roommates
Mertens
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Quartic rationally derived polynomials
Buchholz
;
MacDougall
✭✭✭
0
Number Theory
mdevos
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Theory
»
Graph Algorithms
fhavet
Primitive pythagorean n-tuple tree
✭✭
0
Number Theory
tsihonglau
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
Point sets with no empty pentagon
Wood
✭
1
Geometry
David Wood
Petersen coloring conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Perfect cuboid
✭✭
0
Number Theory
»
Computational N.T.
tsihonglau
Perfect 2-error-correcting codes over arbitrary finite alphabets.
✭✭
0
Combinatorics
»
Codes
davidcullen
Pentagon problem
Nesetril
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Pebbling a cartesian product
Graham
✭✭✭
0
Graph Theory
mdevos
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Partitioning the Projective Plane
Noel
✭✭
1
Geometry
Jon Noel
Partitioning edge-connectivity
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
mdevos
Partition of Complete Geometric Graph into Plane Trees
✭✭
0
Geometry
David Wood
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Packing T-joins
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
Outward reloid of composition vs composition of outward reloids
Porton
✭✭
0
Topology
porton
Outer reloid of restricted funcoid
Porton
✭✭
0
Topology
porton
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
Order-invariant queries
Segoufin
✭✭
0
Logic
»
Finite Model Theory
dberwanger
One-way functions exist
✭✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
porton
Olson's Conjecture
Olson
✭✭
0
Number Theory
»
Combinatorial N.T.
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