49 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Umeå UniversitySE2 papers
- University of WarwickGB2 papers
- Center for Astrophysics Harvard & SmithsonianUS1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Centro de MatemáticaPT1 paper
- EURECOMFR1 paper
- European University CyprusCY1 paper
- Institute of Informatics and TelematicsIT1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Istituto Nazionale di Fisica Nucleare, Sezione di Roma IIT1 paper
- Las Cumbres Observatory Global Telescope NetworkUS1 paper
- LIP6FR1 paper
5 papers · 1 filter
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
Ioannis Michos, Christina Savvidou
Super-strong Wilf equivalence classes of the symmetric group on letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Sa…
First order convergence and roots
Demetres Christofides, Daniel Kral
Nesetril and Ossona de Mendez introduced the notion of first order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether if G_i is a…
The range of thresholds for diameter 2 in random Cayley graphs
Demetres Christofides, Klas Markström
Given a group G, the model \mathcal{G}(G,p) denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with…
The thresholds for diameter 2 in random Cayley graphs
Demetres Christofides, Klas Markström
Given a group G, the model denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random wit…
Hamilton cycles in dense vertex-transitive graphs
Demetres Christofides, Jan Hladký, András Máthé
A famous conjecture of Lovász states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is…