Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
A conjecture about direct product of funcoids
Porton
✭✭
0
Topology
porton
Circular choosability of planar graphs
Mohar
✭
0
Graph Theory
»
Coloring
»
Homomorphisms
rosskang
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Graph Theory
»
Probabilistic G.T.
DOT
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Graph Theory
Andrew King
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Vertex Cover Integrality Gap
Atserias
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Graph Theory
»
Coloring
fhavet
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
Graph Theory
fhavet
Melnikov's valency-variety problem
Melnikov
✭
0
Graph Theory
»
Coloring
»
Vertex coloring
asp
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Lovász Path Removal Conjecture
Lovasz
✭✭
0
Graph Theory
fhavet
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
Graph Theory
fhavet
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Graph Theory
»
Basic G.T.
fhavet
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Triangle-packing vs triangle edge-transversal.
Tuza
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
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
« 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