Publication
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Related publications (39)
Non-planarity of Markoff graphs mod p
We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation x2 + y2 + z2 = xyz modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these gr ...
Berlin2024Maximum Independent Set: Self-Training through Dynamic Programming
Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis
This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...
2023A full characterization of invariant embeddability of unimodular planar graphs
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...
WILEY2023Frequent asymmetric migrations suppress natural selection in spatially structured populations
Anne-Florence Raphaëlle Bitbol, Alia Abbara
Natural microbial populations often have complex spatial structures. This can impact their evolution, in particular the ability of mutants to take over. While mutant fixation probabilities are known to be unaffected by sufficiently symmetric structures, ev ...
Oxford2023Improved Ramsey-type results for comparability graphs
Istvan Tomon, Dániel József Korándi
Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...
CAMBRIDGE UNIV PRESS2020Edge colorings of graphs without monochromatic stars
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph on n vertices may admit. Our results rely on an improved application of an ...
ELSEVIER2020Time-resolved analysis of dynamic graphs: an extended Slepian design
Dimitri Nestor Alice Van De Ville, Raphaël Pierre Liégeois, Ibrahim Merad
Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allow ...
SPIE-INT SOC OPTICAL ENGINEERING2019Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs
Matthias Grossglauser, Negar Kiyavash, Osman Emre Dai
Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-Rény ...
Association for Computing Machinery (ACM)2019Generalized Turan Problems For Even Cycles
Given a graph H and a set of graphs F, let ex(n, H, F) denote the maximum possible number of copies of H in an T-free graph on n vertices. We investigate the function ex(n, H, F), when H and members of F are cycles. Let C-k denote the cycle of length k and ...
2019Exploring Selection Bias by Causal Frailty Models
Counter-intuitive associations appear frequently in epidemiology, and these results are often debated. In particular, several scenarios are characterized by a general risk factor that appears protective in particular subpopulations, for example, individual ...
2017