Image de couverture de livre

Reconstructing random graphs from distance queries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Krivelevich, Michael, Zhukovskii, Maksim
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Non-isomorphic subgraphs in random graphs
par: Krivelevich, Michael, et autres
Publié: (2025)

Maximum chordal subgraphs of random graphs
par: Krivelevich, Michael, et autres
Publié: (2023)

A large hole in pseudo-random graphs
par: Diskin, Sahar, et autres
Publié: (2025)

Canonical labelling of sparse random graphs
par: Verbitsky, Oleg, et autres
Publié: (2024)

On the maximum number of common neighbours in dense random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2023)

First order distinguishability of sparse random graphs
par: Hershko, Tal, et autres
Publié: (2024)

Tree tilings in random regular graphs
par: Diskin, Sahar, et autres
Publié: (2024)

Stability of large cuts in random graphs
par: Hoshen, Ilay, et autres
Publié: (2024)

Maximum induced trees and forests of bounded degree in random graphs
par: Akhmejanova, Margarita, et autres
Publié: (2024)

A very sharp threshold for first order logic distinguishability of random graphs
par: Benjamini, Itai, et autres
Publié: (2022)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
par: Hefetz, Dan, et autres
Publié: (2025)

Colouring graphs from random lists
par: Hefetz, Dan, et autres
Publié: (2024)

Sharp thresholds for spanning regular subgraphs
par: Zhukovskii, Maksim
Publié: (2025)

The Hamilton cycle space of random graphs
par: Hefetz, Dan, et autres
Publié: (2025)

Sprinkling with random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2023)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
par: Krivelevich, Michael, et autres
Publié: (2026)

Weak saturation numbers of large complete bipartite graphs
par: Akhmejanova, Margarita, et autres
Publié: (2025)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

A logical approach to concentration
par: Benedikt, Michael, et autres
Publié: (2026)

Bounded-degree spanning trees in randomly perturbed graphs
par: Krivelevich, Michael, et autres
Publié: (2015)

Weak saturation rank: a failure of linear algebraic approach to weak saturation
par: Terekhov, Nikolai, et autres
Publié: (2024)

Spectrum of FO logic with quantifier depth 4 is finite
par: Yarovikov, Yury, et autres
Publié: (2021)

Sums along the edges of bounded degree graphs
par: Alon, Noga, et autres
Publié: (2025)

When does a tree activate the random graph?
par: Antonir, Asaf Cohen, et autres
Publié: (2025)

Canonical labelling of random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2026)

Disjoint connected dominating sets in pseudorandom graphs
par: Draganić, Nemanja, et autres
Publié: (2024)

Extremal independence in discrete random systems
par: Isaev, Mikhail, et autres
Publié: (2021)

Hitting time of connectedness in the random hypercube process
par: Diskin, Sahar, et autres
Publié: (2024)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
par: Diskin, Sahar, et autres
Publié: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
par: Diskin, Sahar, et autres
Publié: (2024)

Subgraph discrepancies in the complete graph
par: Christoph, Micha, et autres
Publié: (2026)

A Jump of the Saturation Number in Random Graphs?
par: Diskin, Sahar, et autres
Publié: (2023)

Majority dynamics on finite trees
par: Benjamini, Itai, et autres
Publié: (2025)

New bounds for the optimal density of covering single-insertion codes via the Turán density
par: Pikhurko, Oleg, et autres
Publié: (2024)

Faces in girth-saturated graphs on surfaces
par: Axenovich, Maria, et autres
Publié: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

Gathering Information about a Graph by Counting Walks from a Single Vertex
par: Fuhlbrück, Frank, et autres
Publié: (2024)

On the edge expansion of random polytopes
par: Ferber, Asaf, et autres
Publié: (2025)

Minors in small-set expanders
par: Krivelevich, Michael, et autres
Publié: (2025)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
par: Diskin, Sahar, et autres
Publié: (2024)