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
Robustness of Erdős–Ko–Rado Theorems on Permutations and Perfect Matchings
Robustness of Erdős–Ko–Rado Theorems on Permutations and Perfect Matchings
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Karen Gunderson
,
Karen Meagher
,
Joy Morris
,
Venkata Raghu Tej Pantangi
,
Mahsa N. Shirazi
Format:
Artículo Open Access
Published:
Wiley
2026
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
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
by: Gunderson, Karen, et al.
Published: (2024)
A new measure of robustness of Erdős--Ko--Rado Theorems on permutation groups
by: Gunderson, Karen, et al.
Published: (2025)
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
by: Michael Molloy, et al.
Published: (2025)
Erdős‐Rogers Functions for Arbitrary Pairs of Graphs
by: Dhruv Mubayi, et al.
Published: (2026)
Improved Bounds for the Erdős–Rogers (s,s+2)‐Problem
by: Oliver Janzer, et al.
Published: (2025)