:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Christoph, Micha, Nenadov, Rajko, Petrova, Kalina
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2402.01447
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Counting sparse induced subgraphs in locally dense graphs
por: Nenadov, Rajko
Publicado: (2024)

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

The number of arcs in $\mathbb{F}_q^2$ of a given cardinality
por: Nenadov, Rajko
Publicado: (2024)

Improved bound on the number of cycle sets
por: Nenadov, Rajko
Publicado: (2025)

Hypergraph universality via branching random walks
por: Nenadov, Rajko
Publicado: (2024)

Spread blow-up lemma with an application to perturbed random graphs
por: Nenadov, Rajko, et al.
Publicado: (2024)

Multipartite nearly orthogonal sets over finite fields
por: Nenadov, Rajko, et al.
Publicado: (2024)

Minors in small-set expanders
por: Krivelevich, Michael, et al.
Publicado: (2025)

Sumsets of random sets
por: Nenadov, Rajko, et al.
Publicado: (2026)

A note on digraph splitting
por: Christoph, Micha, et al.
Publicado: (2023)

Refuting Perfect Matchings in Spectral Expanders is Hard
por: Biswas, Ari, et al.
Publicado: (2025)

Global rigidity of random graphs in $\mathbb{R}$
por: Montgomery, Richard, et al.
Publicado: (2024)

Short proof of the hypergraph container theorem
por: Nenadov, Rajko, et al.
Publicado: (2024)

Transference for loose Hamilton cycles in random $3$-uniform hypergraphs
por: Petrova, Kalina, et al.
Publicado: (2022)

Smaller universal posets
por: Bastide, Paul, et al.
Publicado: (2025)

Extending Thomassen's conjecture to directed graphs
por: Christoph, Micha, et al.
Publicado: (2025)

Hitting time for Hamilton cycles in pseudorandom graphs
por: Chen, Yaobin, et al.
Publicado: (2026)

The largest subgraph without a forbidden induced subgraph
por: Fox, Jacob, et al.
Publicado: (2024)

Sharp thresholds for higher powers of Hamilton cycles in random graphs
por: Makai, Tamás, et al.
Publicado: (2025)

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

Universality for graphs with bounded density
por: Alon, Noga, et al.
Publicado: (2023)

Size-Ramsey numbers of graphs with maximum degree three
por: Draganić, Nemanja, et al.
Publicado: (2022)

Universality for transversal Hamilton cycles in random graphs
por: Christoph, Micha, et al.
Publicado: (2025)

Odd-Ramsey numbers of Hamilton cycles
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)

Turán problems in pseudorandom graphs
por: Liu, Xizhi, et al.
Publicado: (2022)

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

The critical activation density in graph bootstrap percolation
por: Kolesnik, Brett, et al.
Publicado: (2026)

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

Packing subdivisions into regular graphs
por: Montgomery, Richard, et al.
Publicado: (2025)

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

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

Spectral expansion properties of pseudorandom bipartite graphs
por: Fan, Dandan, et al.
Publicado: (2024)

On the number of distinct spanning trees in pseudorandom graphs
por: Wang, Yiting
Publicado: (2026)

Embedding loose spanning trees in 3-uniform hypergraphs
por: Pehova, Yanitsa, et al.
Publicado: (2023)

Note on the trace of random walks on pseudorandom graphs
por: Chen, Yaobin, et al.
Publicado: (2026)

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

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

Odd-Ramsey numbers of complete bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2024)

Ramsey number of a cycle versus a graph of a given size
por: Cambie, Stijn, et al.
Publicado: (2026)

Spectrally indistinguishable pseudorandom graphs
por: Forey, Arthur, et al.
Publicado: (2025)