Cover Image

Homogeneous substructures in random ordered hyper-matchings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dudek, Andrzej, Grytczuk, Jarosław, Przybyło, Jakub, Ruciński, Andrzej
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Homogeneous substructures in random ordered uniform matchings
by: Dudek, Andrzej, et al.
Published: (2026)

Largest bipartite sub-matchings of a random ordered matching or a problem with socks
by: Dudek, Andrzej, et al.
Published: (2024)

Ordered unavoidable sub-structures in matchings and random matchings
by: Dudek, Andrzej, et al.
Published: (2022)

Erdős-Szekeres type Theorems for ordered uniform matchings
by: Dudek, Andrzej, et al.
Published: (2023)

Multiple twins in permutations
by: Dudek, Andrzej, et al.
Published: (2021)

Shuffle squares and ordered nest-free graphs
by: Grytczuk, Jarosław, et al.
Published: (2025)

Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs
by: Antoniuk, Sylwia, et al.
Published: (2025)

Packing arithmetic progressions
by: Alon, Noga, et al.
Published: (2026)

Neighborly boxes and strings with jokers; constructions and asymptotics
by: Grytczuk, Jarosław, et al.
Published: (2025)

Neighborly boxes and bipartite coverings; constructions and conjectures
by: Grytczuk, Jarosław, et al.
Published: (2024)

Loose paths in random ordered hypergraphs
by: Dudek, Andrzej, et al.
Published: (2025)

Mrs. Correct and Majority Colorings
by: Anholcer, Marcin, et al.
Published: (2022)

Words Avoiding Tangrams
by: Dębski, Michał, et al.
Published: (2024)

Creating Subgraphs in Semi-Random Hypergraph Games
by: Behague, Natalie, et al.
Published: (2024)

Decomposability of regular graphs to $4$ locally irregular subgraphs
by: Przybyło, Jakub
Published: (2024)

The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
by: Przybyło, Jakub
Published: (2024)

Asymptotically Tight Bound for the Conflict-Free Chromatic Index
by: Kamyczura, Mateusz, et al.
Published: (2026)

Generalized Ramsey numbers at the linear and quadratic thresholds
by: Bennett, Patrick, et al.
Published: (2023)

The generalized Ramsey number $f(n, 5, 8) = \frac 67 n + o(n)$
by: Bennett, Patrick, et al.
Published: (2024)

Variations on shuffle squares
by: Grytczuk, Jarosław, et al.
Published: (2023)

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
by: Behague, Natalie C., et al.
Published: (2021)

On list extensions of the majority edge colourings
by: Pękała, Paweł, et al.
Published: (2025)

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2024)

On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2026)

Degree-balanced decompositions of cubic graphs
by: Lužar, Borut, et al.
Published: (2024)

Antidirected paths in oriented graphs
by: Grzesik, Andrzej, et al.
Published: (2025)

Further progress on Wojda's conjecture
by: Cisiński, Maciej, et al.
Published: (2026)

Graphs without a rainbow path of length 3
by: Babiński, Sebastian, et al.
Published: (2022)

Tops of graphs of non-degenerate linear codes
by: Bartnicka, Edyta, et al.
Published: (2023)

Degree conditions forcing directed cycles
by: Grzesik, Andrzej, et al.
Published: (2021)

A note on a flip-connected class of generalized domino tilings of the box $[0,2]^n$
by: Kisielewicz, Andrzej P.
Published: (2024)

Hecke algebra action on twisted motivic Chern classes and K-theoretic stable envelopes
by: Koncki, Jakub, et al.
Published: (2023)

A canonical Ramsey theorem with list constraints in random (hyper-)graphs
by: Alvarado, José D., et al.
Published: (2023)

Rainbow Cliques in Edge-Colored Graphs
by: Czygrinow, Andrzej, et al.
Published: (2024)

Subgraphs with a positive minimum semidegree in digraphs with large outdegree
by: Grzesik, Andrzej, et al.
Published: (2024)

Strong modeling limits of graphs with bounded tree-width
by: Grzesik, Andrzej, et al.
Published: (2021)

Counting substructures and eigenvalues II: quadrilaterals
by: Ning, Bo, et al.
Published: (2021)

How to get the random graph with non-uniform probabilities?
by: Coregliano, Leonardo N., et al.
Published: (2024)

Polynomial removal lemma for ordered matchings
by: Gishboliner, Lior, et al.
Published: (2023)

Perfect matchings in random sparsifications of Dirac hypergraphs
by: Kang, Dong Yeap, et al.
Published: (2022)