Cover Image

Matchings in permutations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Inozemtsev, Eduard, Kolupaev, Dmitrii, Kupavskii, Andrey
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

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

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

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

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

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

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

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

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
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)

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

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)

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

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

Graphs, Disjoint Matchings and Some Inequalities
by: Hambardzumyan, Lianna, et al.
Published: (2015)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
by: Sumnicht, Christopher, et al.
Published: (2024)

Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

Some permutation pentanomials over finite fields of even characteristic
by: Kousar, Farhana, et al.
Published: (2024)

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
by: Park, Seongbeom
Published: (2025)

On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)

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

Finding Minimum Matching Cuts in $H$-free Graphs
by: Lucke, Felicia, et al.
Published: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
by: Lucke, Felicia
Published: (2025)

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

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

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

On Patterns and Languages in 1-11-Representations of Graphs
by: Das, Biswajit, et al.
Published: (2026)

The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)

Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
by: Karol, Nikolai, et al.
Published: (2026)

On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)