Open Problem Garden
Help
About
Contact
login/create account
Home
Solved problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Bounded colorings for planar graphs
Alon
;
Ding
;
Oporowski
;
Vertigan
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Decomposing the truncated octahedron into parallelepipeds
✭
1
Geometry
»
Polytopes
mdevos
5-coloring graphs with small crossing & clique numbers
Oporowski
;
Zhao
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Coloring squares of hypercubes
Wan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Petersen graph conjecture
Mkrtchyan
;
Petrosyan
✭
1
Graph Theory
»
Basic G.T.
»
Matchings
vahanmkrtchyan2002
Inequality of complex numbers
✭✭
1
Analysis
feanor
spanning trees
✭✭
1
Graph Theory
akhodkar
Hitting every large maximal clique with a stable set
King
;
Rabern
✭✭
1
Graph Theory
Andrew King
Ohba's Conjecture
Ohba
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Special M
Kimberling
✭✭
1
Number Theory
vprusso
Choice number of complete multipartite graphs with parts of size 4
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Difference between neighbors in a matrix
Vadim Lioubimov
✭
1
Combinatorics
»
Matrices
Vadim Lioubimov
Colouring $d$-degenerate graphs with large girth
Wood
✭✭
1
Graph Theory
»
Coloring
David Wood
(2 + epsilon)-flow conjecture
Goddyn
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Matching polynomials of vertex transitive graphs
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Fowler's Conjecture on eigenvalues of (3,6)-polyhedra
Fowler
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Hirsch Conjecture
Hirsch
✭✭✭
0
Geometry
»
Polytopes
Robert Samal
Alon-Saks-Seymour Conjecture
Alon
;
Saks
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
The sum of the two largest eigenvalues
Gernert
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Bounding the chromatic number of graphs with no odd hole
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Intersection of complete funcoids
Porton
✭✭
0
Topology
porton
Monovalued reloid is a restricted function
Porton
✭✭
0
Topology
porton
Distributivity of composition over union of reloids
Porton
✭✭
0
Topology
porton
Funcoid corresponding to inward reloid
Porton
✭✭
0
Topology
porton
Distributivity of outward reloid over composition of funcoids
Porton
✭✭
0
Topology
porton
Outward reloid corresponding to a funcoid corresponding to convex reloid
Porton
✭✭
0
Topology
porton
Inward reloid corresponding to a funcoid corresponding to convex reloid
Porton
✭✭
0
Topology
porton
Distributivity of union of funcoids corresponding to reloids
Porton
✭✭
0
Topology
porton
Reloid corresponding to funcoid is between outward and inward reloid
Porton
✭✭
0
Topology
porton
Bigger cycles in cubic graphs
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Straight line representation of planar linear hypergraphs
Ossona de Mendez
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
Hall-Paige conjecture
Hall
;
Paige
✭✭✭
0
Group Theory
mdevos
Is every regular paratopological group Tychonoff?
unknown
✭✭
0
Topology
porton
Exponentially many perfect matchings in cubic graphs
Lovasz
;
Plummer
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Monochromatic reachability in edge-colored tournaments
Erdos
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Middle levels problem
Erdos
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
tchow
On Gersgorin Theorem
✭✭
0
Algebra
Miwa Lin
Composition of atomic reloids
Porton
✭✭
0
Topology
porton
Atomic reloids are monovalued
Porton
✭✭
0
Topology
porton
Monovalued reloid restricted to atomic filter
Porton
✭✭
0
Topology
porton
Do filters complementive to a given filter form a complete lattice?
Porton
✭✭
0
Unsorted
porton
Pseudodifference of filter objects
Porton
✭✭
0
Unsorted
porton
Co-separability of filter objects
Porton
✭✭
0
Unsorted
porton
Chain-meet-closed sets
Porton
✭✭
0
Unsorted
porton
Outer reloid of direct product of filters
Porton
✭✭
0
Topology
porton
Composition of reloids expressed through atomic reloids
Porton
✭✭
0
Topology
porton
Characterization of monovalued reloids with atomic domains
Porton
✭✭
0
Topology
porton
Domain and image of inner reloid
Porton
✭✭
0
Topology
porton
Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?
Heckman
;
Thomas
✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Join of oblique products
Porton
✭✭
0
Topology
porton
1
2
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