Measurable Perfect Matchings for Acyclic Locally Countable Borel graphs.

Clinton T. Conley Benjamin D. Miller

Published in: J. Symb. Log. (2017)

Keyphrases

maximum cardinality
np hard
markov chain
connected graphs
graph theoretic
graph matching
bipartite graph
graph theory
weighted graph
graph structure
graph mining
undirected graph
graph partitioning
subgraph isomorphism
bounded treewidth
directed graph
lower bound