:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Portier, Julien
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2604.27989
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global rigidity of random graphs in $\mathbb{R}$
by: Montgomery, Richard, et al.
Published: (2024)

Reconstructing a giant component of a point set in $\mathbb{R}$
by: Portier, Julien
Published: (2026)

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

Almost colour-balanced spanning forests in complete graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

The asymptotic of off-diagonal online Ramsey numbers for paths
by: Mond, Adva, et al.
Published: (2023)

Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)

Approximate Itai-Zehavi conjecture for random graphs
by: Hollom, Lawrence, et al.
Published: (2025)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

Minimally globally rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2022)

Monotonicity and decompositions of random regular graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Explorations on the number of realizations of minimally rigid graphs
by: Grasegger, Georg
Published: (2025)

Tight bounds for expected propagation time of probabilistic zero forcing
by: Jelassi, Mehdi, et al.
Published: (2025)

Double-jump phase transition for the reverse Littlewood--Offord problem
by: Hollom, Lawrence, et al.
Published: (2025)

On Galois groups of type-1 minimally rigid graphs
by: Makhul, Mehdi, et al.
Published: (2023)

Clique packings in random graphs
by: Griffiths, Simon, et al.
Published: (2024)

Clique covers and decompositions of cliques of graphs
by: Balogh, József, et al.
Published: (2024)

A note on high-dimensional discrepancy of subtrees
by: Hollom, Lawrence, et al.
Published: (2024)

Cliques in Paley graphs of square order and in Peisert graphs
by: Brouwer, Andries E., et al.
Published: (2025)

Clique number of xor-powers of Kneser graphs
by: Füredi, Zoltán, et al.
Published: (2025)

Clique factors in random samplings of regular graphs
by: Sun, Wanting, et al.
Published: (2025)

Partial reflections and globally linked pairs in rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2023)

Highly regular vertex-transitive graphs are globally rigid
by: Saliby, Angelo El
Published: (2026)

Local and global $d$-rigidity are not definable in the first order logic of graphs
by: Bernstein, Daniel Irving, et al.
Published: (2025)

Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
by: Dewar, Sean
Published: (2022)

On Clique Graphs and Clique Regular Graphs
by: Petro, Robert R., et al.
Published: (2025)

Clique-factors in graphs with low $K_{\ell}$-independence number
by: Chen, Ming, et al.
Published: (2025)

On generic 3-rigidity of graphs
by: Baranyai, Tamás
Published: (2024)

Clique-free t-matchings in degree-bounded graphs
by: Paluch, Katarzyna, et al.
Published: (2024)

A Comprehensive Study of Clique Graphs and Clique Regular Graphs
by: Phillips, Connor
Published: (2026)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
by: Krivelevich, Michael, et al.
Published: (2026)

A note on interval colourings of graphs
by: Axenovich, Maria, et al.
Published: (2023)

Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
by: Barnes, Douglas, et al.
Published: (2024)

Clique structure and other network properties of the tensor product of Erdős-Rényi graphs
by: Islak, Umit, et al.
Published: (2024)

Clique covers of complete graphs and piercing multitrack intervals
by: Barát, János, et al.
Published: (2024)

Globally rigid graphs are fully reconstructible
by: Garamvölgyi, Dániel, et al.
Published: (2021)

Coloring minimal Cayley graphs
by: García-Marco, Ignacio, et al.
Published: (2024)

Exponential odd-distance sets under the Manhattan metric
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Globally linked pairs and cheapest globally rigid supergraphs
by: Jordán, Tibor, et al.
Published: (2024)

Clique density vs blowups
by: Bradač, Domagoj, et al.
Published: (2024)