Saved in:
| Main Authors: | Behague, Natalie C., Marbach, Trent G., Pralat, Pawel, Rucinski, Andrzej |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2105.07034 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Creating Subgraphs in Semi-Random Hypergraph Games
by: Behague, Natalie, et al.
Published: (2024)
by: Behague, Natalie, et al.
Published: (2024)
Hopping Forcing Number in Random $d$-regular Graphs
by: Pralat, Pawel, et al.
Published: (2024)
by: Pralat, Pawel, et al.
Published: (2024)
Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
Hypergraph burning, matchings, and zero forcing
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)
by: Frieze, Alan, et al.
Published: (2023)
Asynchronous Majority Dynamics on Binomial Random Graphs
by: Mohan, Divyarthi, et al.
Published: (2023)
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)
by: Gamarnik, David, et al.
Published: (2023)
Nearly all known Euclidean Ramsey sets are subsoluble
by: Behague, Natalie
Published: (2025)
by: Behague, Natalie
Published: (2025)
Burning Random Trees
by: Devroye, Luc, et al.
Published: (2024)
by: Devroye, Luc, et al.
Published: (2024)
Multiple twins in permutations
by: Dudek, Andrzej, et al.
Published: (2021)
by: Dudek, Andrzej, et al.
Published: (2021)
Largest bipartite sub-matchings of a random ordered matching or a problem with socks
by: Dudek, Andrzej, et al.
Published: (2024)
by: Dudek, Andrzej, et al.
Published: (2024)
Erdős-Szekeres type Theorems for ordered uniform matchings
by: Dudek, Andrzej, et al.
Published: (2023)
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)
by: Antoniuk, Sylwia, et al.
Published: (2025)
Ordered unavoidable sub-structures in matchings and random matchings
by: Dudek, Andrzej, et al.
Published: (2022)
by: Dudek, Andrzej, et al.
Published: (2022)
On the Random Minimum Spanning Subgraph Problem for Hypergraphs
by: Zvonkov, Nikita
Published: (2024)
by: Zvonkov, Nikita
Published: (2024)
How to cool a graph
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
Between burning and cooling: liminal burning on graphs
by: Bonato, Anthony, et al.
Published: (2025)
by: Bonato, Anthony, et al.
Published: (2025)
The isoperimetric peak of complete trees
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
Locally finite graphs and their localization numbers
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
How to burn a Latin square
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)
by: Mauras, Simon, et al.
Published: (2025)
Colour-biased Hamilton cycles in dense graphs and random graphs
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Sabotage the Mantel Theorem
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Homogeneous substructures in random ordered hyper-matchings
by: Dudek, Andrzej, et al.
Published: (2025)
by: Dudek, Andrzej, et al.
Published: (2025)
Homogeneous substructures in random ordered uniform matchings
by: Dudek, Andrzej, et al.
Published: (2026)
by: Dudek, Andrzej, et al.
Published: (2026)
Common Pairs of Graphs
by: Behague, Natalie, et al.
Published: (2022)
by: Behague, Natalie, et al.
Published: (2022)
The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)
by: Bonato, Anthony, et al.
Published: (2023)
Almost all 9-regular graphs have a modulo-5 orientation
by: Delcourt, Michelle, et al.
Published: (2022)
by: Delcourt, Michelle, et al.
Published: (2022)
A proof of the Kim-Vu sandwich conjecture
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Cuts, Cats, and Complete Graphs
by: Ashmore, Rylo, et al.
Published: (2024)
by: Ashmore, Rylo, et al.
Published: (2024)
A case of the dijoin conjecture on inverting oriented graphs
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Direct Paths in the Temporal Hypercube
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
Tic-Tac-Toe on Designs
by: Danziger, Peter, et al.
Published: (2024)
by: Danziger, Peter, et al.
Published: (2024)
A note on inverting the dijoin of oriented graphs
by: Behague, Natalie, et al.
Published: (2024)
by: Behague, Natalie, et al.
Published: (2024)
Layered subgraphs of the hypercube
by: Behague, Natalie, et al.
Published: (2024)
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)
by: Molloy, Michael, et al.
Published: (2023)
Hypergraphs without Subgraphs of Given Connectivity
by: Ma, Jie, et al.
Published: (2026)
by: Ma, Jie, et al.
Published: (2026)
Shuffle squares and ordered nest-free graphs
by: Grytczuk, Jarosław, et al.
Published: (2025)
by: Grytczuk, Jarosław, et al.
Published: (2025)
Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)
by: Behague, Natalie, et al.
Published: (2026)
The rainbow saturation number is linear
by: Behague, Natalie, et al.
Published: (2022)
by: Behague, Natalie, et al.
Published: (2022)
Similar Items
-
Creating Subgraphs in Semi-Random Hypergraph Games
by: Behague, Natalie, et al.
Published: (2024) -
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) -
Hypergraph burning, matchings, and zero forcing
by: Bonato, Anthony, et al.
Published: (2024) -
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)