Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime
✭✭
0
Number Theory
princeps
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Lucas Numbers Modulo m
✭✭
1
Number Theory
Martin Erickson
Sum of prime and semiprime conjecture
Geoffrey Marnell
✭✭
0
Number Theory
princeps
Giuga's Conjecture on Primality
Giuseppe Giuga
✭✭
0
Number Theory
princeps
Alexa's Conjecture on Primality
Alexa
✭✭
0
Number Theory
princeps
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
Graph Theory
azi
Fixed-point logic with counting
Blass
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Order-invariant queries
Segoufin
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Monadic second-order logic with cardinality predicates
Courcelle
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Blatter-Specker Theorem for ternary relations
Makowsky
✭✭
0
Logic
»
Finite Model Theory
dberwanger
MSO alternation hierarchy over pictures
Grandjean
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Convex uniform 5-polytopes
✭✭
1
Geometry
ACW
A conjecture about direct product of funcoids
Porton
✭✭
0
Topology
porton
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
Inequality for square summable complex series
Retkes
✭✭
1
Analysis
tigris35711
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
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
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
Earth-Moon Problem
Ringel
✭✭
1
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
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
« first
‹ previous
…
3
4
5
6
7
8
9
10
11
…
next ›
last »
Navigate
Subject
Algebra
(295)
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
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more