Open Problem Garden
Help
About
Contact
login/create account
Home
Solved problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Values of a multifuncoid on atoms
Porton
✭✭
0
Topology
porton
Every monovalued reloid is metamonovalued
Porton
✭✭
0
Topology
porton
Total Dominator Chromatic Number of a Hypercube
Adel P. Kazemi
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Adel P. Kazemi
Colouring $d$-degenerate graphs with large girth
Wood
✭✭
1
Graph Theory
»
Coloring
David Wood
Nonrepetitive colourings of planar graphs
Alon N.
;
Grytczuk J.
;
Hałuszczak M.
;
Riordan O.
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Geometric Hales-Jewett Theorem
Por
;
Wood
✭✭
0
Geometry
David Wood
Inner reloid through the lattice Gamma
Porton
✭✭
0
Topology
porton
Restricting a reloid to lattice Gamma before converting it into a funcoid
Porton
✭✭
0
Topology
porton
Funcoid corresponding to reloid through lattice Gamma
Porton
✭✭
0
Topology
porton
Domain and image for Gamma-reloid
Porton
✭✭
0
Topology
porton
Entourages of a composition of funcoids
Porton
✭✭
0
Topology
porton
(2 + epsilon)-flow conjecture
Goddyn
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Hirsch Conjecture
Hirsch
✭✭✭
0
Geometry
»
Polytopes
Robert Samal
Alon-Saks-Seymour Conjecture
Alon
;
Saks
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Bounding the chromatic number of graphs with no odd hole
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Hall-Paige conjecture
Hall
;
Paige
✭✭✭
0
Group Theory
mdevos
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
DIS-PROOF OF BEALS CONJECTURE
✭✭✭
0
Number Theory
»
Additive N.T.
lalitha
A construction of direct product in the category of continuous maps between endo-funcoids
Porton
✭✭✭
0
Topology
porton
Total Domination number of a hypercube
Adel P. Kazemi
✭✭✭
0
Graph Theory
»
Basic G.T.
Adel P. Kazemi
Steinberg's conjecture
✭✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
« first
‹ previous
1
2
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