Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Michael Molloy
,
Paweł Prałat
,
Gregory B. Sorkin
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Random Structures & Algorithms
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://onlinelibrary.wiley.com/doi/10.1002/rsa.21270
Similar Items
Sequentially Constrained Hamilton Cycles in Random Graphs
by: Alan Frieze, et al.
Published: (2025)
Robustness of Erdős–Ko–Rado Theorems on Permutations and Perfect Matchings
by: Karen Gunderson, et al.
Published: (2026)
Independent Sets in Hypergraphs
by: Jacques Verstraete, et al.
Published: (2026)
The square of a Hamilton cycle in randomly perturbed graphs
by: Julia Böttcher, et al.
Published: (2024)
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs
by: Kalina Petrova, et al.
Published: (2024)