Imagen de Portada

Combinatorial sufficient conditions for graph rigidity and applications to random graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Krivelevich, Michael, Lew, Alan, Michaeli, Peleg
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimum degree conditions for graph rigidity
por: Krivelevich, Michael, et al.
Publicado: (2024)

Fast construction on a restricted budget
por: Frieze, Alan, et al.
Publicado: (2022)

Karp's patching algorithm on random perturbations of dense digraphs
por: Frieze, Alan, et al.
Publicado: (2022)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
por: Hefetz, Dan, et al.
Publicado: (2025)

The Hamilton cycle space of random graphs
por: Hefetz, Dan, et al.
Publicado: (2025)

Colouring graphs from random lists
por: Hefetz, Dan, et al.
Publicado: (2024)

Non-isomorphic subgraphs in random graphs
por: Krivelevich, Michael, et al.
Publicado: (2025)

Maximum chordal subgraphs of random graphs
por: Krivelevich, Michael, et al.
Publicado: (2023)

Reconstructing random graphs from distance queries
por: Krivelevich, Michael, et al.
Publicado: (2024)

Bounded-degree spanning trees in randomly perturbed graphs
por: Krivelevich, Michael, et al.
Publicado: (2015)

A large hole in pseudo-random graphs
por: Diskin, Sahar, et al.
Publicado: (2025)

Partition density, star arboricity, and sums of Laplacian eigenvalues of graphs
por: Lew, Alan
Publicado: (2024)

Disjoint connected dominating sets in pseudorandom graphs
por: Draganić, Nemanja, et al.
Publicado: (2024)

Stiffness matrices of graph blow-ups and the $d$-dimensional algebraic connectivity of complete bipartite graphs
por: Jung, Yunseong, et al.
Publicado: (2025)

Complexes of graphs with bounded independence number
por: Kim, Minki, et al.
Publicado: (2019)

Subgraph discrepancies in the complete graph
por: Christoph, Micha, et al.
Publicado: (2026)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
por: Diskin, Sahar, et al.
Publicado: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
por: Diskin, Sahar, et al.
Publicado: (2024)

Fast Construction on a Restricted Budget
por: Alan Frieze, et al.
Publicado: (2025)

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

Hitting time of connectedness in the random hypercube process
por: Diskin, Sahar, et al.
Publicado: (2024)

Two sufficient conditions for graphs to admit path factors
por: Zhou, Sizhong, et al.
Publicado: (2023)

Some sufficient conditions for graphs to have component factors
por: Zhou, Sizhong
Publicado: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
por: Deniz, Zakir, et al.
Publicado: (2025)

A sufficient condition for pancyclic graphs
por: Zhan, Xingzhi
Publicado: (2024)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

The intersection of a random geometric graph with an Erdős-Rényi graph
por: Bennett, Patrick, et al.
Publicado: (2024)

A very robust Ramsey theorem for matchings
por: Keevash, Peter, et al.
Publicado: (2026)

A generalised Ramsey--Turán problem for matchings
por: Keevash, Peter, et al.
Publicado: (2025)

Defect and transference versions of the Alon-Frankl-Lovasz theorem
por: Gishboliner, Lior, et al.
Publicado: (2025)

Colorful Hamilton cycles in random graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)

Coloring powers of random graphs
por: Frieze, Alan, et al.
Publicado: (2026)

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

The Moran process on a random graph
por: Frieze, Alan, et al.
Publicado: (2024)

On the geometry of exponential random graphs and applications
por: Tarkeshian, Mohabat
Publicado: (2024)

On the $k$-volume rigidity of a simplicial complex in $\mathbb{R}^d$
por: Lew, Alan, et al.
Publicado: (2025)

Random walks on edge colored random graphs
por: Cooper, Colin, et al.
Publicado: (2024)

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors
por: Zhong, Jiaxu, et al.
Publicado: (2026)

Cliques in minimally globally rigid graphs
por: Portier, Julien
Publicado: (2026)

An approximate version of Brouwer's Laplacian conjecture
por: Lew, Alan
Publicado: (2026)