Open Problem Garden
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Graph Theory
»
Hypergraphs
Dino
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Turán's problem for hypergraphs
Turan
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Theory
»
Graph Algorithms
fhavet
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Graph Theory
»
Extremal G.T.
boris
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
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
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Graph Theory
»
Extremal G.T.
asp
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Graph Theory
»
Extremal G.T.
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
The Two Color Conjecture
Neumann-Lara
✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Woodall's Conjecture
Woodall
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
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
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
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
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
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
berger
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
Navigate
more
Recent Activity
KPZ Universality Conjecture
3-Edge-Coloring Conjecture
Several ways to apply a (multivalued) multiargument function to a family of filters
Jones' conjecture
Multicolour Erdős--Hajnal Conjecture
more