Imagen de Portada

Creating Subgraphs in Semi-Random Hypergraph Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Behague, Natalie, Pralat, Pawel, Rucinski, Andrzej
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Nearly all known Euclidean Ramsey sets are subsoluble
por: Behague, Natalie
Publicado: (2025)

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

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

Burning Random Trees
por: Devroye, Luc, et al.
Publicado: (2024)

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

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

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

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

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

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

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

Multiple twins in permutations
por: Dudek, Andrzej, et al.
Publicado: (2021)

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

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

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

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

Sabotage the Mantel Theorem
por: Behague, Natalie, et al.
Publicado: (2025)

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

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

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

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

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

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

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

Layered subgraphs of the hypercube
por: Behague, Natalie, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Common Pairs of Graphs
por: Behague, Natalie, et al.
Publicado: (2022)

Saturation in Random Hypergraphs
por: Diskin, Sahar, et al.
Publicado: (2024)

Counting simplicial pairs in hypergraphs
por: Barrett, Jordan, et al.
Publicado: (2024)

Perfect Matchings in Random Sparsifications of Dense Hypergraphs
por: Han, Jie, et al.
Publicado: (2025)

Minimum Number of Monochromatic Subgraphs of a Random Graph
por: Dandi, Yatin, et al.
Publicado: (2026)