Recent Activity
Arc-disjoint strongly connected spanning subdigraphs ★★
Author(s): Bang-Jensen; Yeo
Keywords:
Arc-disjoint out-branching and in-branching ★★
Author(s): Thomassen
Keywords:
Strong edge colouring conjecture ★★
A strong edge-colouring of a graph is a edge-colouring in which every colour class is an induced matching; that is, any two vertices belonging to distinct edges with the same colour are not adjacent. The strong chromatic index is the minimum number of colours in a strong edge-colouring of .
Keywords:
Long directed cycles in diregular digraphs ★★★
Author(s): Jackson
Keywords:
Splitting a digraph with minimum outdegree constraints ★★★
Author(s): Alon
Keywords:
Stable set meeting all longest directed paths. ★★
Author(s): Laborde; Payan; Xuong N.H.
Keywords:
Ádám's Conjecture ★★★
Author(s): Ádám
Keywords:
Caccetta-Häggkvist Conjecture ★★★★
Author(s): Caccetta; Häggkvist
Keywords:
Directed path of length twice the minimum outdegree ★★★
Author(s): Thomassé
Keywords:
Antidirected trees in digraphs ★★
Author(s): Addario-Berry; Havet; Linhares Sales; Reed; Thomassé
An antidirected tree is an orientation of a tree in which every vertex has either indegree 0 or outdergree 0.
Keywords:
Decomposing an even tournament in directed paths. ★★★
Author(s): Alspach; Mason; Pullman
Keywords:
Oriented trees in n-chromatic digraphs ★★★
Author(s): Burr
Keywords:
Discrete Logarithm Problem ★★★
Author(s):
If is prime and , we write if satisfies . The problem of finding such an integer for a given (with ) is the Discrete Log Problem.
Keywords: discrete log; NP
Good Edge Labelings ★★
Author(s): Araújo; Cohen; Giroire; Havet
We say that a graph is good-edge-labeling critical, if it has no good edge labeling, but every proper subgraph has a good edge labeling.
Keywords: good edge labeling, edge labeling
Special Primes ★
Author(s): George BALAN
Keywords:
Three-chromatic (0,2)-graphs ★★
Author(s): Payan
Keywords:
Choice Number of k-Chromatic Graphs of Bounded Order ★★
Author(s): Noel
Keywords: choosability; complete multipartite graph; list coloring
The Riemann Hypothesis ★★★★
Author(s): Riemann
The zeroes of the Riemann zeta function that are inside the Critical Strip (i.e. the vertical strip of the complex plane where the real part of the complex variable is in ]0;1[), are actually located on the Critical line ( the vertical line of the complex plane with real part equal to 1/2)
Keywords: Millenium Problems; zeta
Euler-Mascheroni constant ★★★
Author(s):
Keywords: constant; Euler; irrational; Mascheroni; rational; transcendental
Graham's conjecture on tree reconstruction ★★
Author(s): Graham
Keywords: reconstruction; tree