Home

Open Problems


TitleAuthor(s)Imp.¹Rec.²Area » Topic » Subtopicsort iconPosted by
Ryser's conjectureRyser✭✭✭0Graph Theory » Hypergraphsmdevos
¿Are critical k-forests tight?Strausz✭✭0Graph Theory » HypergraphsDino
Frankl's union-closed sets conjectureFrankl✭✭0Graph Theory » Hypergraphstchow
Simultaneous partition of hypergraphsKühn; Osthus✭✭0Graph Theory » Hypergraphsfhavet
Turán's problem for hypergraphsTuran✭✭0Graph Theory » Hypergraphsfhavet
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Theory » Graph Algorithmsmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Theory » Graph Algorithmsmdevos
PTAS for feedback arc set in tournamentsAilon; Alon✭✭0Graph Theory » Graph Algorithmsfhavet
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Graph Theory » Extremal G.T.mdevos
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Graph Theory » Extremal G.T.boris
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Graph Theory » Extremal G.T.shudeshijie
Complexity of the H-factor problem.Kühn; Osthus✭✭0Graph Theory » Extremal G.T.fhavet
Odd-cycle transversal in triangle-free graphsErdos; Faudree; Pach; Spencer✭✭0Graph Theory » Extremal G.T.fhavet
Triangle-packing vs triangle edge-transversal.Tuza✭✭0Graph Theory » Extremal G.T.fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing✭✭✭0Graph Theory » Extremal G.T.asp
Weak saturation of the cube in the cliqueMorrison; Noel✭1Graph Theory » Extremal G.T.Jon Noel
Multicolour Erdős--Hajnal ConjectureErdos; Hajnal✭✭✭0Graph Theory » Extremal G.T.Jon Noel
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Graph Theory » Directed Graphs » Tournamentsmdevos
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.Thomassen✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
Partitionning a tournament into k-strongly connected subtournaments.Thomassen✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
Decomposing k-arc-strong tournament into k spanning strong digraphsBang-Jensen; Yeo✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
The Two Color ConjectureNeumann-Lara✭✭0Graph Theory » Directed Graphsmdevos
Woodall's ConjectureWoodall✭✭✭0Graph Theory » Directed Graphsmdevos
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Graph Theory » Directed GraphsJS
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Graph Theory » Directed Graphsnkorppi
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Graph Theory » Directed Graphsmdevos
Oriented trees in n-chromatic digraphsBurr✭✭✭0Graph Theory » Directed Graphsfhavet
Antidirected trees in digraphsAddario-Berry; Havet; Linhares Sales; Reed; Thomassé✭✭0Graph Theory » Directed Graphsfhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Graph Theory » Directed Graphsfhavet
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Graph Theory » Directed Graphsfhavet
Ádám's ConjectureÁdám✭✭✭0Graph Theory » Directed Graphsfhavet
Splitting a digraph with minimum outdegree constraintsAlon✭✭✭0Graph Theory » Directed Graphsfhavet
Long directed cycles in diregular digraphsJackson✭✭✭0Graph Theory » Directed Graphsfhavet
Arc-disjoint out-branching and in-branchingThomassen✭✭0Graph Theory » Directed Graphsfhavet
Subdivision of a transitive tournament in digraphs with large outdegree. Mader✭✭0Graph Theory » Directed Graphsfhavet
Hamilton cycle in small d-diregular graphsJackson✭✭0Graph Theory » Directed Graphsfhavet
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Graph Theory » Directed Graphsfhavet
Arc-disjoint directed cycles in regular directed graphsAlon; McDiarmid; Molloy✭✭0Graph Theory » Directed Graphsfhavet
Cyclic spanning subdigraph with small cyclomatic numberBondy✭✭0Graph Theory » Directed Graphsfhavet
Large acyclic induced subdigraph in a planar oriented graph.Harutyunyan✭✭0Graph Theory » Directed Graphsfhavet
Erdős-Posa property for long directed cyclesHavet; Maia✭✭0Graph Theory » Directed Graphsfhavet
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Graph Theory » Directed Graphsfhavet
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Graph Theory » Coloring » Vertex coloringberger
Reed's omega, delta, and chi conjectureReed✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Oriented chromatic number of planar graphs✭✭0Graph Theory » Coloring » Vertex coloringRobert Samal
Coloring and immersionAbu-Khzam; Langston✭✭✭1Graph Theory » Coloring » Vertex coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Graph Theory » Coloring » Vertex coloringIradmusa

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content