Twins in ordered hyper-matchings

DOI10.7151/DMGT.2535MaRDI QIDQ6982907zbMATH OpenFDO

Authors Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński

Publication date 15 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2535

zbMATH Keywords

hypergraphsordered matchingstwins

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A combinatorial problem in geometry.
• A regularity lemma and twins in words
• Concentration for Independent Permutations
• Concentration for locally acting permutations
• Concentration of measure and isoperimetric inequalities in product spaces
• Erdős-Szekeres type theorems for ordered uniform matchings
• Extremal, enumerative and probabilistic results on ordered hypergraph matchings
• Order-isomorphic twins in permutations
• Ordered unavoidable sub-structures in matchings and random matchings
• Patterns in ordered (random) matchings
• Self-similarity of graphs
• Variations on twins in permutations

This page was built for publication: Twins in ordered hyper-matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982907)