Imagen de Portada

Bounded-degree spanning trees in randomly perturbed graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Krivelevich, Michael, Kwan, Matthew, Sudakov, Benny
Formato:	Preprint
Publicado:	2015
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

On the number of spanning trees in random regular graphs
por: Greenhill, Catherine, et al.
Publicado: (2013)

Induced Ramsey problems for trees and graphs with bounded treewidth
por: Hunter, Zach, et al.
Publicado: (2024)

Acyclic subgraphs of tournaments with high chromatic number
por: Fox, Jacob, et al.
Publicado: (2019)

Restricted subgraphs of edge-colored graphs and applications
por: Sudakov, Benny
Publicado: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)

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)

Lower bounds for Ramsey numbers of bounded degree hypergraphs
por: Bradač, Domagoj, et al.
Publicado: (2025)

Gaussian random graphs and Ramsey numbers
por: Hunter, Zach, et al.
Publicado: (2025)

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

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)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
por: Diskin, Sahar, et al.
Publicado: (2024)

Packing subgraphs in regular graphs
por: Letzter, Shoham, et al.
Publicado: (2025)

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

Counting subgraphs in locally dense graphs
por: Bradač, Domagoj, et al.
Publicado: (2024)

Incidence bounds via extremal graph theory
por: Milojević, Aleksa, et al.
Publicado: (2024)

The growth rate of multicolor Ramsey numbers of $3$-graphs
por: Bradač, Domagoj, et al.
Publicado: (2023)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
por: Gishboliner, Lior, et al.
Publicado: (2024)

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

$C_4$-free subgraphs of high degree with geometric applications
por: Hunter, Zach, et al.
Publicado: (2025)

Approximate path decompositions of regular graphs
por: Montgomery, Richard, et al.
Publicado: (2024)

On the Turán number of the hypercube
por: Janzer, Oliver, et al.
Publicado: (2022)

Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
por: Janzer, Oliver, et al.
Publicado: (2023)

Ordered Ramsey numbers of graphs with $m$ edges
por: Bradač, Domagoj, et al.
Publicado: (2024)

Anticoncentration of random spanning trees in almost regular graphs
por: Lee, Hyunwoo
Publicado: (2026)

A closure result on spanning $k$-trees of graphs with given minimum degree
por: Zhang, Wenqian
Publicado: (2026)

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

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
por: Anastos, Michael, et al.
Publicado: (2023)

Set mappings for general graphs
por: Gishboliner, Lior, et al.
Publicado: (2026)

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

Randomly perturbed digraphs also have bounded-degree spanning trees
por: Morawski, Patryk, et al.
Publicado: (2023)

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

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

Canonical Ramsey numbers of sparse graphs
por: Gishboliner, Lior, et al.
Publicado: (2024)

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

Long induced paths in $K_{s, s}$-free graphs
por: Hunter, Zach, et al.
Publicado: (2024)