:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Montgomery, Richard, Pavez-Signé, Matías
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2308.07195
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ramsey numbers of bounded degree trees versus general graphs
by: Montgomery, Richard, et al.
Published: (2023)

Ramsey numbers of trees
by: Montgomery, Richard, et al.
Published: (2025)

Colour-bias perfect matchings in hypergraphs
by: Hàn, Hiêp, et al.
Published: (2024)

The Lovász conjecture holds for moderately dense Cayley graphs
by: Bedert, Benjamin, et al.
Published: (2026)

Optimal spread for spanning subgraphs of Dirac hypergraphs
by: Kelly, Tom, et al.
Published: (2023)

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

Monochromatic partitions in 2-edge-coloured bipartite graphs
by: Fernández, Camila, et al.
Published: (2024)

Spanning clique subdivisions in pseudorandom graphs
by: Lee, Hyunwoo, et al.
Published: (2025)

A degree version of the Burr-Erdős conjecture on trees
by: Katz, Jasmin, et al.
Published: (2026)

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

Ramsey numbers of cycles in random graphs
by: Araújo, Pedro, et al.
Published: (2022)

Ramsey numbers for 1-degenerate 3-graphs
by: Allen, Peter, et al.
Published: (2025)

Regular subgraphs at every density
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)

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

The number of cliques in hypergraphs with forbidden subgraphs
by: Basu, Ayush, et al.
Published: (2024)

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

Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)

Tiling dense hypergraphs
by: Lang, Richard
Published: (2023)

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

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

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

Random Turán theorem for expansions of spanning subgraphs of tight trees
by: Nie, Jiaxi
Published: (2023)

From finding a spanning subgraph $H$ to an $H$-factor
by: Lo, Allan
Published: (2025)

Separating edges by linearly many subdivisions
by: Kontogeorgiou, George, et al.
Published: (2025)

The existence of biregular spanning subgraphs in bipartite graphs via spectral radius
by: Fan, Dandan, et al.
Published: (2024)

Extremal problems in uniformly dense hypergraphs and digraphs
by: Lin, Hao, et al.
Published: (2026)

Turán density of stars in uniformly dense hypergraphs
by: Lin, Hao, et al.
Published: (2025)

Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)

Induced subgraph density. II. Sparse and dense sets in cographs
by: Fox, Jacob, et al.
Published: (2023)

Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)

Counting induced subgraphs with the Kromatic symmetric function
by: Pierson, Laura
Published: (2024)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

Counting color-critical subgraphs under Nikiforov's condition
by: Fang, Longfei, et al.
Published: (2026)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

Berge Hamilton cycles in a random sparsification of dense hypergraphs
by: Im, Seonghyuk, et al.
Published: (2025)

Counting tight Hamilton cycles in Dirac hypergraphs
by: Joos, Felix, et al.
Published: (2026)

Normal approximation for subgraph count in random hypergraphs
by: Michalczuk, Wojciech, et al.
Published: (2024)

Counting induced subgraphs with given intersection sizes
by: Zhang, Haixiang, et al.
Published: (2025)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)