Domino Tile Placing on Graphs
Probability
2018-08-21 v1
Abstract
Given a graph we consider sequentially placing dimers on it, namely choosing a maximal independent subset of edges, i.e. edges that do not share common vertices. We study the number of vertices that do not belong to any edge found in the maximal set. We prove a CLT result for this model in the case when the underlying graph is .
Keywords
Cite
@article{arxiv.1808.06163,
title = {Domino Tile Placing on Graphs},
author = {Jacob J. Kagan},
journal= {arXiv preprint arXiv:1808.06163},
year = {2018}
}
Comments
15 pages, 1 figure