2024/10/17 by Cristina G. Fernandes, Tássio Naia, Fernandes, Cristina G. +4
Engineering · #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Packing Problems #Scheduling and Optimization Algorithms #VLSI and FPGA Design Techniques
paper · pdf · doi:10.48550/arxiv.2410.13290
openalex publication_date 2024/10/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that for every γ> 0 there exists n0 ∈ ℕ such that for every n ≥ n0 any family of up to \lfloorn\frac12+γ\rfloor trees having at most (1-γ)n vertices in each bipartition class can be packed into Kn,n. As a tool for our proof, we show an approximate bipartite version of the Komlós-Sárközy-Szemerédi Theorem, which we believe to be of independent interest.