Cover Image

Non-isomorphic subgraphs in random graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Krivelevich, Michael, Zhukovskii, Maksim
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Sharp thresholds for spanning regular subgraphs
by: Zhukovskii, Maksim
Published: (2025)

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

On the maximum number of common neighbours in dense random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

Tree tilings in random regular graphs
by: Diskin, Sahar, et al.
Published: (2024)

Stability of large cuts in random graphs
by: Hoshen, Ilay, et al.
Published: (2024)

Maximum induced trees and forests of bounded degree in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2024)

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

Colouring random subgraphs
by: Bukh, Boris, et al.
Published: (2023)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

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

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

Colouring graphs from random lists
by: Hefetz, Dan, et al.
Published: (2024)

Sprinkling with random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

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

Weak saturation numbers of large complete bipartite graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

A logical approach to concentration
by: Benedikt, Michael, et al.
Published: (2026)

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

Spectrum of FO logic with quantifier depth 4 is finite
by: Yarovikov, Yury, et al.
Published: (2021)

Weak saturation rank: a failure of linear algebraic approach to weak saturation
by: Terekhov, Nikolai, et al.
Published: (2024)

Sums along the edges of bounded degree graphs
by: Alon, Noga, et al.
Published: (2025)

When does a tree activate the random graph?
by: Antonir, Asaf Cohen, et al.
Published: (2025)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

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

Extremal independence in discrete random systems
by: Isaev, Mikhail, et al.
Published: (2021)

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

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

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

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

Majority dynamics on finite trees
by: Benjamini, Itai, et al.
Published: (2025)

A Jump of the Saturation Number in Random Graphs?
by: Diskin, Sahar, et al.
Published: (2023)

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

Rainbow subgraphs of uniformly coloured randomly perturbed graphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

Non-bipartite graphs without theta subgraphs
by: Fang, Longfei, et al.
Published: (2025)

Faces in girth-saturated graphs on surfaces
by: Axenovich, Maria, et al.
Published: (2024)

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