Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

output

20052026

most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

Showing 2023 · math.COShow all

2 papers · 2 filters

math.CO2023★ 7 cited

Neighbourhood complexity of graphs of bounded twin-width

Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä +1

We give essentially tight bounds for, $ν (d, k)$ , the maximum number of distinct neighbourhoods on a set $X$ of $k$ vertices in a graph with twin-width at most~ $d$ . Using the celebra…

math.CO2023★ 1 cited

Isometric path complexity of graphs

Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud +1

A set $S$ of isometric paths of a graph $G$ is `` $v$ -rooted'', where $v$ is a vertex of $G$ , if $v$ is one of the endpoints of all the isometric paths in $S$ . The isometric path co…