default search action
European Journal of Combinatorics, Volume 77
Volume 77, March 2019
- Katie Anders, Kassie Archer:
Rooted forests that avoid sets of permutations. 1-16 - Gustavo Araújo, Daniel Pellegrino:
A Gale-Berlekamp permutation-switching problem in higher dimensions. 17-30 - Paul Ellis, Dániel T. Soukup:
Cycle reversions and dichromatic number in tournaments. 31-48 - Jakub Przybylo:
A note on asymptotically optimal neighbour sum distinguishing colourings. 49-56 - Agelos Georgakopoulos, John Haslegrave, Richard Montgomery:
Forcing large tight components in 3-graphs. 57-67 - Haya S. Aldosari, Catherine S. Greenhill:
Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. 68-77 - Rögnvaldur G. Möller, Primoz Potocnik, Norbert Seifter:
Infinite arc-transitive and highly-arc-transitive digraphs. 78-89 - Diana Piguet, Maria Saumell:
A median-type condition for graph tiling. 90-101 - Pierre-Yves Bienvenu, Thái Hoàng Lê:
A bilinear Bogolyubov theorem. 102-113
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.