Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Switching reconstruction conjecture
Stanley
✭✭
0
Graph Theory
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
Graph Theory
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Turán's problem for hypergraphs
Turan
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Theory
»
Graph Algorithms
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Graph Theory
»
Extremal G.T.
asp
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
Sub-atomic product of funcoids is a categorical product
✭✭
0
Algebra
porton
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)
✭✭✭✭
0
Topology
Jailton Viana
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
Graph Theory
fhavet
inverse of an integer matrix
Gregory
✭✭
0
Algebra
lvoyster
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Are all Fermat Numbers square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there only finite Fermat Primes?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Kriesell's Conjecture
Kriesell
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
Jon Noel
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Graph Theory
»
Coloring
Jon Noel
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
Imbalance conjecture
Kozerenko
✭✭
0
Graph Theory
Sergiy Kozerenko
Graphs of exact colorings
✭✭
0
Algebra
sabisood
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Dirac's Conjecture
Dirac
✭✭
0
Geometry
David Wood
Generalized path-connectedness in proximity spaces
Porton
✭✭
0
Topology
porton
Direct proof of a theorem about compact funcoids
Porton
✭✭
0
Topology
porton
General position subsets
Gowers
✭✭
0
Geometry
David Wood
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
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
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
« 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