Imagen de Portada

On the local resilience of random geometric graphs with respect to connectivity and long cycles

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Díaz, Alberto Espuny, Lichev, Lyuben, Wesolek, Alexandra
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$d$-connectivity of the random graph with restricted budget
por: Lichev, Lyuben
Publicado: (2022)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
por: Ignasiak, Dawid, et al.
Publicado: (2025)

Color-avoiding percolation on the Erdős-Rényi random graph
por: Lichev, Lyuben, et al.
Publicado: (2022)

Vertex-separating path systems in random graphs
por: Lichev, Lyuben, et al.
Publicado: (2024)

Dynamic random graphs with vertex removal
por: Díaz, Josep, et al.
Publicado: (2022)

Spanning trees of bounded degree in random geometric graphs
por: Anastos, Michael, et al.
Publicado: (2025)

d $d$‐connectivity of the random graph with restricted budget
por: Lyuben Lichev
Publicado: (2024)

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

Colouring random Hasse diagrams and box-Delaunay graphs
por: Jin, Zhihan, et al.
Publicado: (2025)

Universality of the matching number in percolated regular graphs
por: Diskin, Sahar, et al.
Publicado: (2025)

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
por: Díaz, Alberto Espuny, et al.
Publicado: (2025)

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

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

How many random edges make an almost-Dirac graph Hamiltonian?
por: Díaz, Alberto Espuny, et al.
Publicado: (2024)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
por: Christoph, Micha, et al.
Publicado: (2026)

Seymour's second neighbourhood conjecture: random graphs and reductions
por: Díaz, Alberto Espuny, et al.
Publicado: (2024)

On constructing small subgraphs in the budget-constrained random graph process
por: Antoniuk, Sylwia, et al.
Publicado: (2026)

Nearly spanning cycle in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

The maximal running time of hypergraph bootstrap percolation
por: Hartarsky, Ivailo, et al.
Publicado: (2022)

Explosive appearance of cores and bootstrap percolation on lattices
por: Hartarsky, Ivailo, et al.
Publicado: (2025)

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

A note on highly connected $K_{2,\ell}$-minor free graphs
por: Bousquet, Nicolas, et al.
Publicado: (2023)

On $2$-factors of Hamiltonian graphs
por: Díaz, Alberto Espuny, et al.
Publicado: (2026)

Local dimer dynamics in higher dimensions
por: Hartarsky, Ivailo, et al.
Publicado: (2023)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$
por: Glock, Stefan, et al.
Publicado: (2024)

Rainbow connectivity of multilayered random geometric graphs
por: Díaz, Josep, et al.
Publicado: (2024)

Dirac's theorem for graphs of bounded bandwidth
por: Díaz, Alberto Espuny, et al.
Publicado: (2024)

Speeding up random walk mixing by starting from a uniform vertex
por: Díaz, Alberto Espuny, et al.
Publicado: (2022)

Cycle lengths in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

Percolation on dense random graphs with given degrees
por: Lichev, Lyuben, et al.
Publicado: (2022)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
por: Bonamy, Marthe, et al.
Publicado: (2022)

On plane cycles in geometric multipartite graphs
por: Ricci, Marco, et al.
Publicado: (2025)

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
por: Draganić, Nemanja, et al.
Publicado: (2025)

Longest cycles and longest chordless cycles in $2$-connected graphs
por: Hu, Yanan, et al.
Publicado: (2024)

Every graph is eventually Turán-good
por: Morrison, Natasha, et al.
Publicado: (2022)

Diameter and mixing time of the giant component in the percolated hypercube
por: Anastos, Michael, 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)

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

Label propagation on binomial random graphs
por: Kiwi, Marcos, et al.
Publicado: (2023)

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