Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Inequality of the means
✭✭✭
0
Geometry
mdevos
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
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
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
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Friendly partitions
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
Graph Theory
mdevos
Are almost all graphs determined by their spectrum?
✭✭✭
0
Graph Theory
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Graph Theory
»
Basic G.T.
mhaythorpe
trace inequality
✭✭
0
Algebra
Miwa Lin
Half-integral flow polynomial values
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
mohar
Convex 'Fair' Partitions Of Convex Polygons
Nandakumar
;
Ramana
✭✭
1
Geometry
Nandakumar
Convex Equipartitions with Extreme Perimeter
Nandakumar
✭✭
1
Geometry
Nandakumar
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
The robustness of the tensor product
Ben-Sasson
;
Sudan
✭✭✭
0
Theoretical Comp. Sci.
»
Coding Theory
ormeir
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
ormeir
S(S(f)) = S(f) for reloids
Porton
✭✭
0
Topology
porton
Algebraic independence of pi and e
✭✭✭
0
Number Theory
porton
Lindelöf hypothesis
Lindelöf
✭✭
0
Number Theory
»
Analytic N.T.
porton
Outer reloid of restricted funcoid
Porton
✭✭
0
Topology
porton
Sticky Cantor sets
✭✭
0
Topology
porton
Nonseparating planar continuum
✭✭
0
Topology
porton
Hilbert-Smith conjecture
David Hilbert
;
Paul A. Smith
✭✭
0
Topology
porton
Strict inequalities for products of filters
Porton
✭
0
Topology
porton
Funcoidal products inside an inward reloid
Porton
✭✭
0
Topology
porton
Upgrading a completary multifuncoid
Porton
✭✭
0
Topology
porton
Atomicity of the poset of completary multifuncoids
Porton
✭✭
0
Topology
porton
Atomicity of the poset of multifuncoids
Porton
✭✭
0
Topology
porton
Graph product of multifuncoids
Porton
✭✭
0
Topology
porton
A conjecture about direct product of funcoids
Porton
✭✭
0
Topology
porton
Sub-atomic product of funcoids is a categorical product
✭✭
0
Algebra
porton
Decomposition of completions of reloids
Porton
✭✭
0
Topology
porton
Every metamonovalued funcoid is monovalued
Porton
✭✭
0
Topology
porton
Every metamonovalued reloid is monovalued
Porton
✭✭
0
Topology
porton
Generalized path-connectedness in proximity spaces
Porton
✭✭
0
Topology
porton
Direct proof of a theorem about compact funcoids
Porton
✭✭
0
Topology
porton
One-way functions exist
✭✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
porton
Another conjecture about reloids and funcoids
Porton
✭✭
0
Topology
porton
What are hyperfuncoids isomorphic to?
Porton
✭✭
0
Topology
porton
Infinite distributivity of meet over join for a principal funcoid
Porton
✭✭
0
Topology
porton
A funcoid related to directed topological spaces
Porton
✭✭
0
Topology
porton
Outward reloid of composition vs composition of outward reloids
Porton
✭✭
0
Topology
porton
A diagram about funcoids and reloids
Porton
✭✭
0
Topology
porton
Which outer reloids are equal to inner ones
Porton
✭✭
0
Topology
porton
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime
✭✭
0
Number Theory
princeps
Sum of prime and semiprime conjecture
Geoffrey Marnell
✭✭
0
Number Theory
princeps
« 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