-- Pierre Béaur (LISN, Galac)

summary: TBA

Constellations et b-déformations

-- Victor Nador (LaBRI, Bordeaux)


-- Alice Contat (Université Sorbonne Paris Nord)


-- Paul Thévenin (University of Vienna)

Balanced spanning trees in random geometric graphs

-- Lyuben Lichev (University Jean Monnet, Saint-Etienne)

In a recent breakthrough, Montgomery showed that the Erdos-Rényi random graph G(n,p) typically contains all n-vertex trees of maximum degree Delta slightly above the (sharp) connectivity threshold. We consider the random geometric graph G_d(n,r) obtained by independently assigning a uniformly random position in [0,1]^d ...

Edge k-q-colorability of graphs

-- Selma Djelloul (LISN, Galac)

summary: Given positive integers k, q, we say that a graph is edge k-q-colorable if its edges can be colored in such a way that the number of colors incident to each vertex is at most q and that the size of a largest color class is at most k ...

The freezing threshold for uniformly random colourings of sparse graphs

-- François Pirot (LISN, Galac)

summary: Given a random Δ-regular graph G, it holds that χ(G) ~ Δ / (2 ln Δ) with high probability. However, for any ε > 0 and k large enough, no (randomised) polynomial-time algorithm returning a proper k-colouring of such a random graph G is known to exist when k < (1−ε ...

Polytopes : théorèmes importants et généralisations conjecturales sur des espaces tropicaux

-- Matthieu Piquerez (Univ. de Nantes)

Certains théorèmes importants concernant les polytopes, par exemple le g-théorème et le problème de Minkowski, se trouvent à l'interaction de domaines des mathématiques dont on ne soupçonnerait pas la diversité au premier abord. Divers résultats plus ou moins récents en géométrie algébrique, en géométrie tropicale ou en théorie de ...

Musical juggling: from combinatorial modeling to computer assistance with artistic creation (a thesis in the making)

-- Hoang La (LISN, Galac)

summary: Musical juggling consists of producing music by the very act of juggling. In this context (stemming from a collaboration between computer science researchers at LISN and a juggling artist), we refer more specifically to juggling with balls that each produce a musical note when caught.
The aim of this ...

The χ-binding function of d-directional segment graphs

-- Hoang La (LISN, Galac)

summary: To color a graph properly, one needs at least as many colors as the size of its biggest clique; therefore, the chromatic number χ is lower-bounded by the clique number ω. In general, there are no upper bounds on χ in terms of ω. The graphs for which we ...

Page 1 / 22 »