Cover Image

Near-optimal edge partitioning via intersecting families

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yakunin, Alexander, Kupavskii, Andrey, Sushin, Alexander, Moiseev, Stanislav
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Structure of non-trivial intersecting families
by: Kupavskii, Andrey
Published: (2024)

A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)

An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)

Erd\H os--Ko--Rado type results for partitions via spread approximations
by: Kupavskii, Andrey
Published: (2023)

Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)

More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)

Delta-system method: a survey
by: Kupavskii, Andrey
Published: (2025)

The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)

Non-dissective coverings by planks
by: Kupavskii, Andrey, et al.
Published: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

Frankl's diversity theorem for permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

Two questions on Kneser colorings
by: Inozemtsev, Eduard, et al.
Published: (2024)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

Stability for binary scalar products
by: Kupavskii, Andrey, et al.
Published: (2024)

Matchings in permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

On the Vertices of Delta-modular Polyhedra
by: Mikhail, Bludov, et al.
Published: (2025)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
by: Dakhno, Grigorii, et al.
Published: (2024)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Minimum blocking sets for families of partitions
by: Quintero, Guillermo Gamboa, et al.
Published: (2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

On the parameterized complexity of computing tree-partitions
by: Bodlaender, Hans L., et al.
Published: (2022)

Tree-partitions of graphs with given pathwidth
by: Wood, David R.
Published: (2026)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

SPHERE: Spherical partitioning for large-scale routing optimization
by: Lindermann, Robert Fabian, et al.
Published: (2025)

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

Results on cubic bent and weakly regular bent $p$-ary functions leading to a class of cubic ternary non-weakly regular bent functions
by: Carlet, Claude, et al.
Published: (2025)

Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

A Parallel Hierarchical Approach for Community Detection on Large-scale Dynamic Networks
by: Bokov, Grigoriy, et al.
Published: (2025)

The Complexity of Finding Tangles
by: Firman, Oksana, et al.
Published: (2020)

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

A note on the exact partition polytope of Frieze and Teng
by: Narayanan, Krishna, et al.
Published: (2026)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
by: Helleseth, Tor, et al.
Published: (2025)

Playing Snake on a Graph
by: Graafsma, Denise, et al.
Published: (2025)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)

The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)