![](/files/happy5.png)
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.
![$ p $](/files/tex/928cd9d544fdea62f88a627aaee28c416c4366c0.png)
![$ c(p) $](/files/tex/996da72e7b0b6591ec8cc40dcbe46964d764e211.png)
![$ c(p)=p $](/files/tex/b1a6c0fbe5cae8582d2ef00c5f0f5158c9d9d4be.png)
![$ c(p) $](/files/tex/996da72e7b0b6591ec8cc40dcbe46964d764e211.png)
![$ ({\mathbb Z}_p)^n $](/files/tex/ea205f9e138abfc9a2c6a35332ecc6694ebe6419.png)
Keywords: additive basis; matrix
![Syndicate content Syndicate content](/misc/feed.png)