:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Oropeza, Juan Carlos Buitrago
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2506.02801
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The likely maximum size of twin subtrees in a large random tree
by: Bona, Miklos, et al.
Published: (2023)

The maximum degree of the $r$th power of a sparse random graph
by: Frieze, Alan, et al.
Published: (2024)

On the extrema of the mean subtree order of graphs
by: Cambie, Stijn, et al.
Published: (2025)

The vertex sets of subtrees of a tree
by: Chudnovsky, Maria, et al.
Published: (2025)

Benjamini-Schramm convergence and subtrees of trees
by: Cambie, Stijn, et al.
Published: (2026)

The dimension of sparse and co-sparse random graph orders
by: Gao, Pu, et al.
Published: (2025)

On the Prague dimension of sparse random graphs
by: Joos, Felix, et al.
Published: (2025)

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

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

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

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Embedding induced trees in sparse expanding graphs
by: Girão, António, et al.
Published: (2024)

Structure of lower tails in sparse random graphs
by: Chin, Byron
Published: (2023)

Maximal and maximum induced matchings in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs
by: Ma, Guorui, et al.
Published: (2026)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Planar graphs with the maximum number of induced 6-cycles
by: Savery, Michael
Published: (2021)

A remark on the independence number of sparse random Cayley sum graphs
by: Nenadov, Rajko
Published: (2025)

A note on the chromatic number of the square of a sparse random graph
by: Frieze, Alan, et al.
Published: (2023)

Spectra of high-dimensional sparse random geometric graphs
by: Cao, Yifan, et al.
Published: (2025)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

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

On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)

A counterexample to linear relationship between largest common subtrees and smallest common supertrees
by: Brzeski, Maciej
Published: (2025)

Local central limit theorem for triangle counts in sparse random graphs
by: Araújo, Pedro, et al.
Published: (2023)

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph
by: Fang, Ziyi, et al.
Published: (2024)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

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

Coloring locally sparse graphs
by: Anderson, James, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

The maximum number of maximum dissociation sets in potted graphs
by: Huang, Zejun, et al.
Published: (2024)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

The binomial random graph is a bad inducer
by: Jain, Vishesh, et al.
Published: (2023)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)