An Erdős--Ko--Rado theorem for matchings in the complete graph

Vikram Kamat Neeldhara Misra

Published in: CoRR (2013)

Keyphrases

maximum cardinality
bipartite graph
directed graph
graph structure
graph matching
graph theory
random walk
database
graph partitioning
machine learning
connected components
social network analysis
case study
graph model
graph representation
graph theoretic
graph search
stable set