:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Behague, Natalie, Pralat, Pawel, Rucinski, Andrzej
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2409.19335
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Nearly all known Euclidean Ramsey sets are subsoluble
by: Behague, Natalie
Published: (2025)

Hopping Forcing Number in Random $d$-regular Graphs
by: Pralat, Pawel, et al.
Published: (2024)

Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)

Burning Random Trees
by: Devroye, Luc, et al.
Published: (2024)

Asynchronous Majority Dynamics on Binomial Random Graphs
by: Mohan, Divyarthi, et al.
Published: (2023)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

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

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

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

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

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

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)

On the Random Minimum Spanning Subgraph Problem for Hypergraphs
by: Zvonkov, Nikita
Published: (2024)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)

Colour-biased Hamilton cycles in dense graphs and random graphs
by: Behague, Natalie, et al.
Published: (2025)

Sabotage the Mantel Theorem
by: Behague, Natalie, et al.
Published: (2025)

Homogeneous substructures in random ordered hyper-matchings
by: Dudek, Andrzej, et al.
Published: (2025)

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

Almost all 9-regular graphs have a modulo-5 orientation
by: Delcourt, Michelle, et al.
Published: (2022)

A proof of the Kim-Vu sandwich conjecture
by: Behague, Natalie, et al.
Published: (2025)

A case of the dijoin conjecture on inverting oriented graphs
by: Behague, Natalie, et al.
Published: (2025)

Direct Paths in the Temporal Hypercube
by: Eide, Austin, et al.
Published: (2025)

A note on inverting the dijoin of oriented graphs
by: Behague, Natalie, et al.
Published: (2024)

Layered subgraphs of the hypercube
by: Behague, Natalie, et al.
Published: (2024)

Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
by: Molloy, Michael, et al.
Published: (2023)

Hypergraphs without Subgraphs of Given Connectivity
by: Ma, Jie, et al.
Published: (2026)

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

Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)

The rainbow saturation number is linear
by: Behague, Natalie, et al.
Published: (2022)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Achievable Burning Densities of Growing Grids
by: Barrett, Jordan, et al.
Published: (2026)

A Pragmatic Method for Comparing Clusterings with Overlaps and Outliers
by: DeWolfe, Ryan, et al.
Published: (2026)

Common Pairs of Graphs
by: Behague, Natalie, et al.
Published: (2022)

Counting simplicial pairs in hypergraphs
by: Barrett, Jordan, et al.
Published: (2024)

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

The Maker-Breaker Largest Connected Subgraph Game
by: Bensmail, Julien, et al.
Published: (2024)

Thresholds for constrained Ramsey and anti-Ramsey problems
by: Behague, Natalie, et al.
Published: (2024)

Saturation in Random Hypergraphs
by: Diskin, Sahar, et al.
Published: (2024)

Predicting Properties of Nodes via Community-Aware Features
by: Kamiński, Bogumił, et al.
Published: (2023)