-
Minimal functions on the random graph
32 pages; this is an extension of article 0903.2553 by the same authors -
New Ramsey Classes from Old
11 pages. In the second version, to be submitted for journal publication, a number of typos has been removed, and a grant acknowledgement has been added -
Hyperdeterminants et fonctions symétriques
International audience -
On extremal properties of hyperbolic Coxeter polytopes and their reflection g...
This thesis concerns hyperbolic Coxeter polytopes, their reflection groups and associated combinatorial and geometric invariants. Given a Coxeter group $G$ realisable... -
Minimum ratio cover of matrix columns by extreme rays of its induced cone
International audience -
An easy upper bound for Ramsey numbers
This paper contains no new results but presents a slight simplification of the standard proof by Erdos-Szekeres for Ramsey numbers. The main tool is a new (to my knowledge)... -
Push-relabel based algorithms for the maximum transversal problem
International audience -
Distinguished three-qubit 'magicity' via automorphisms of the split Cayley he...
15 pages, 4 figures, 5 tables -
Telling stories: Enumerating maximal directed acyclic graphs with a constrain...
International audience -
Simplifying inclusion-exclusion formulas
14 pages, 1 figure -
Combinatorial and algorithmic aspects of identifying codes in graphs
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each... -
Well-posedness of the permutation problem in sparse filter estimation with lp...
International audience -
Balance properties of Arnoux-Rauzy words
International audience -
Sparsity (Graphs, Structures, and Algorithms)
International audience -
Foldings in graphs and relations with simplicial complexes and posets
15 pages, 10 figures, partially presented at the 8th French Combinatorial Conference (0rsay, 2010, 28 June - 2 July) -
Decidability of the HD0L ultimate periodicity problem
International audience -
Graph algorithm for the simulation of the interaction between particles
International audience -
A new bound for the 2/3 conjecture
We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these... -
Charting the Real Four-Qubit Pauli Group via Ovoids of a Hyperbolic Quadric o...
18 pages, 13 figures -
Characterizing extremal digraphs for identifying codes and extremal cases of ...
International audience
