Cover Image

Erd\H os--Ko--Rado type results for partitions via spread approximations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kupavskii, Andrey
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
by: Adak, Rajat, et al.
Published: (2026)

Near-optimal edge partitioning via intersecting families
by: Yakunin, Alexander, et al.
Published: (2025)

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

Tree decompositions with small width, spread, order and degree
by: Wood, David R.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

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

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

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)

On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)

More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)

Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)

A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)

Symbolic Sets for Proving Bounds on Rado Numbers
by: Ahmed, Tanbir, et al.
Published: (2025)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Rado's covering problem for cubes and balls: a semi-survey
by: Dall'Ara, Gian Maria, et al.
Published: (2026)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)

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

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)

Linear dependencies, polynomial factors in the Duke--Erd\H os forbidden sunflower problem
by: Kupavskii, Andrey, et al.
Published: (2024)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)