login/create account
    Payan, Charles
Stable set meeting all longest directed paths. ★★
Author(s): Laborde; Payan; Xuong N.H.
Conjecture   Every digraph has a stable set meeting all longest directed paths 
Keywords:
Three-chromatic (0,2)-graphs ★★
Author(s): Payan
Question   Are there any (0,2)-graphs with chromatic number exactly three? 
Keywords:
The additive basis conjecture ★★★
Author(s): Jaeger; Linial; Payan; Tarsi
Conjecture   For every prime 
, there is a constant 
 (possibly 
) so that the union (as multisets) of any 
 bases of the vector space 
 contains an additive basis. 
, there is a constant 
 (possibly 
) so that the union (as multisets) of any 
 bases of the vector space 
 contains an additive basis. Keywords: additive basis; matrix
          
 Drupal
 CSI of Charles University