Saved in:
| Main Authors: | Christoph, Micha, Nenadov, Rajko, Petrova, Kalina |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.01447 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)
by: Nenadov, Rajko
Published: (2024)
A remark on the independence number of sparse random Cayley sum graphs
by: Nenadov, Rajko
Published: (2025)
by: Nenadov, Rajko
Published: (2025)
The number of arcs in $\mathbb{F}_q^2$ of a given cardinality
by: Nenadov, Rajko
Published: (2024)
by: Nenadov, Rajko
Published: (2024)
Improved bound on the number of cycle sets
by: Nenadov, Rajko
Published: (2025)
by: Nenadov, Rajko
Published: (2025)
Hypergraph universality via branching random walks
by: Nenadov, Rajko
Published: (2024)
by: Nenadov, Rajko
Published: (2024)
Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)
by: Nenadov, Rajko, et al.
Published: (2024)
Multipartite nearly orthogonal sets over finite fields
by: Nenadov, Rajko, et al.
Published: (2024)
by: Nenadov, Rajko, et al.
Published: (2024)
Minors in small-set expanders
by: Krivelevich, Michael, et al.
Published: (2025)
by: Krivelevich, Michael, et al.
Published: (2025)
Sumsets of random sets
by: Nenadov, Rajko, et al.
Published: (2026)
by: Nenadov, Rajko, et al.
Published: (2026)
A note on digraph splitting
by: Christoph, Micha, et al.
Published: (2023)
by: Christoph, Micha, et al.
Published: (2023)
Refuting Perfect Matchings in Spectral Expanders is Hard
by: Biswas, Ari, et al.
Published: (2025)
by: Biswas, Ari, et al.
Published: (2025)
Global rigidity of random graphs in $\mathbb{R}$
by: Montgomery, Richard, et al.
Published: (2024)
by: Montgomery, Richard, et al.
Published: (2024)
Short proof of the hypergraph container theorem
by: Nenadov, Rajko, et al.
Published: (2024)
by: Nenadov, Rajko, et al.
Published: (2024)
Transference for loose Hamilton cycles in random $3$-uniform hypergraphs
by: Petrova, Kalina, et al.
Published: (2022)
by: Petrova, Kalina, et al.
Published: (2022)
Smaller universal posets
by: Bastide, Paul, et al.
Published: (2025)
by: Bastide, Paul, et al.
Published: (2025)
Extending Thomassen's conjecture to directed graphs
by: Christoph, Micha, et al.
Published: (2025)
by: Christoph, Micha, et al.
Published: (2025)
Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
The largest subgraph without a forbidden induced subgraph
by: Fox, Jacob, et al.
Published: (2024)
by: Fox, Jacob, et al.
Published: (2024)
Sharp thresholds for higher powers of Hamilton cycles in random graphs
by: Makai, Tamás, et al.
Published: (2025)
by: Makai, Tamás, et al.
Published: (2025)
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
by: Draganić, Nemanja, et al.
Published: (2025)
by: Draganić, Nemanja, et al.
Published: (2025)
Universality for graphs with bounded density
by: Alon, Noga, et al.
Published: (2023)
by: Alon, Noga, et al.
Published: (2023)
Size-Ramsey numbers of graphs with maximum degree three
by: Draganić, Nemanja, et al.
Published: (2022)
by: Draganić, Nemanja, et al.
Published: (2022)
Universality for transversal Hamilton cycles in random graphs
by: Christoph, Micha, et al.
Published: (2025)
by: Christoph, Micha, et al.
Published: (2025)
Odd-Ramsey numbers of Hamilton cycles
by: Boyadzhiyska, Simona, et al.
Published: (2025)
by: Boyadzhiyska, Simona, et al.
Published: (2025)
Turán problems in pseudorandom graphs
by: Liu, Xizhi, et al.
Published: (2022)
by: Liu, Xizhi, et al.
Published: (2022)
On constructing small subgraphs in the budget-constrained random graph process
by: Antoniuk, Sylwia, et al.
Published: (2026)
by: Antoniuk, Sylwia, et al.
Published: (2026)
The critical activation density in graph bootstrap percolation
by: Kolesnik, Brett, et al.
Published: (2026)
by: Kolesnik, Brett, et al.
Published: (2026)
Spanning clique subdivisions in pseudorandom graphs
by: Lee, Hyunwoo, et al.
Published: (2025)
by: Lee, Hyunwoo, et al.
Published: (2025)
Packing subdivisions into regular graphs
by: Montgomery, Richard, et al.
Published: (2025)
by: Montgomery, Richard, et al.
Published: (2025)
Randomly perturbed digraphs also have bounded-degree spanning trees
by: Morawski, Patryk, et al.
Published: (2023)
by: Morawski, Patryk, et al.
Published: (2023)
Disjoint connected dominating sets in pseudorandom graphs
by: Draganić, Nemanja, et al.
Published: (2024)
by: Draganić, Nemanja, et al.
Published: (2024)
Spectral expansion properties of pseudorandom bipartite graphs
by: Fan, Dandan, et al.
Published: (2024)
by: Fan, Dandan, et al.
Published: (2024)
On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)
by: Wang, Yiting
Published: (2026)
Embedding loose spanning trees in 3-uniform hypergraphs
by: Pehova, Yanitsa, et al.
Published: (2023)
by: Pehova, Yanitsa, et al.
Published: (2023)
Note on the trace of random walks on pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
Subgraph discrepancies in the complete graph
by: Christoph, Micha, et al.
Published: (2026)
by: Christoph, Micha, et al.
Published: (2026)
The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)
by: Hefetz, Dan, et al.
Published: (2025)
Odd-Ramsey numbers of complete bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2024)
by: Boyadzhiyska, Simona, et al.
Published: (2024)
Ramsey number of a cycle versus a graph of a given size
by: Cambie, Stijn, et al.
Published: (2026)
by: Cambie, Stijn, et al.
Published: (2026)
Spectrally indistinguishable pseudorandom graphs
by: Forey, Arthur, et al.
Published: (2025)
by: Forey, Arthur, et al.
Published: (2025)
Similar Items
-
Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024) -
A remark on the independence number of sparse random Cayley sum graphs
by: Nenadov, Rajko
Published: (2025) -
The number of arcs in $\mathbb{F}_q^2$ of a given cardinality
by: Nenadov, Rajko
Published: (2024) -
Improved bound on the number of cycle sets
by: Nenadov, Rajko
Published: (2025) -
Hypergraph universality via branching random walks
by: Nenadov, Rajko
Published: (2024)