Saved in:
| Main Authors: | Janzer, Barnabás, Montgomery, Richard |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.10515 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024)
by: Girão, António, et al.
Published: (2024)
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Asymptotically-tight packing and covering with transversal bases in Rota's basis conjecture
by: Montgomery, Richard, et al.
Published: (2025)
by: Montgomery, Richard, 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)
Regular subgraphs at every density
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Sunflowers and Ramsey problems for restricted intersections
by: Janzer, Barnabás, et al.
Published: (2025)
by: Janzer, Barnabás, et al.
Published: (2025)
Ramsey numbers of bounded degree trees versus general graphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
Ramsey numbers of trees
by: Montgomery, Richard, et al.
Published: (2025)
by: Montgomery, Richard, et al.
Published: (2025)
Broadcast independence and packing in certain classes of trees
by: Brewster, Richard C., et al.
Published: (2024)
by: Brewster, Richard C., et al.
Published: (2024)
List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)
by: Kashima, Masaki, et al.
Published: (2026)
Packing large balanced trees into bipartite graphs
by: Fernandes, Cristina G., et al.
Published: (2024)
by: Fernandes, Cristina G., et al.
Published: (2024)
Proof of the KAMAK tree conjecture
by: Christoph, Micha, et al.
Published: (2025)
by: Christoph, Micha, et al.
Published: (2025)
On the second largest adjacency eigenvalue of trees with given diameter
by: Kumar, Hitesh, et al.
Published: (2024)
by: Kumar, Hitesh, et al.
Published: (2024)
Counting largest mutual-visibility and general position sets of glued $t$-ary trees
by: Roy, Dhanya, et al.
Published: (2024)
by: Roy, Dhanya, et al.
Published: (2024)
A proof of the Kim-Vu sandwich conjecture
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
The $d$-distance $p$-packing domination number: complexity, cycles, and trees
by: Bujtás, Csilla, et al.
Published: (2025)
by: Bujtás, Csilla, et al.
Published: (2025)
Packing subdivisions into regular graphs
by: Montgomery, Richard, et al.
Published: (2025)
by: Montgomery, Richard, et al.
Published: (2025)
The probability that a random graph is even-decomposable
by: Janzer, Oliver, et al.
Published: (2024)
by: Janzer, Oliver, et al.
Published: (2024)
Hamiltonicity of regular sublinear expanders
by: Bradač, Domagoj, et al.
Published: (2026)
by: Bradač, Domagoj, et al.
Published: (2026)
On the Turán number of the hypercube
by: Janzer, Oliver, et al.
Published: (2022)
by: Janzer, Oliver, et al.
Published: (2022)
Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)
by: Janzer, Oliver, et al.
Published: (2025)
Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
Short monochromatic odd cycles
by: Janzer, Oliver, et al.
Published: (2025)
by: Janzer, Oliver, et al.
Published: (2025)
A degree version of the Burr-Erdős conjecture on trees
by: Katz, Jasmin, et al.
Published: (2026)
by: Katz, Jasmin, et al.
Published: (2026)
The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)
by: Angel, Omer, et al.
Published: (2025)
On a square packing conjecture of Erdős
by: Singh, Anshul Raj
Published: (2026)
by: Singh, Anshul Raj
Published: (2026)
Slack-Pack algorithm for Meir-Moser packing problem
by: Kislovskiy, A. D., et al.
Published: (2024)
by: Kislovskiy, A. D., et al.
Published: (2024)
Concentration of the largest induced tree size of $G_{n,p}$ around the standard expectation threshold
by: Hofstad, Jakob
Published: (2026)
by: Hofstad, Jakob
Published: (2026)
Transversals in Latin Squares
by: Montgomery, Richard
Published: (2024)
by: Montgomery, Richard
Published: (2024)
Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)
by: Gishboliner, Lior, et al.
Published: (2024)
An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)
by: Ramos, Eric, et al.
Published: (2025)
On tree decompositions whose trees are subgraphs
by: Chen, Rong, et al.
Published: (2026)
by: Chen, Rong, et al.
Published: (2026)
Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)
by: Dhawan, Abhishek, et al.
Published: (2025)
Power saving for the Brown-Erdős-Sós problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
Almost every Latin square has a decomposition into transversals
by: Bowtell, Candida, et al.
Published: (2025)
by: Bowtell, Candida, et al.
Published: (2025)
Trees with many leaves in tournaments
by: Benford, Alistair, et al.
Published: (2022)
by: Benford, Alistair, et al.
Published: (2022)
Bijections in weakly increasing trees via binary trees
by: Li, Yang, et al.
Published: (2025)
by: Li, Yang, et al.
Published: (2025)
Similar Items
-
Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024) -
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
by: Janzer, Barnabás, et al.
Published: (2024) -
Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024) -
Asymptotically-tight packing and covering with transversal bases in Rota's basis conjecture
by: Montgomery, Richard, et al.
Published: (2025) -
Extending Thomassen's conjecture to directed graphs
by: Christoph, Micha, et al.
Published: (2025)