Bipartite Induced Subgraphs and Well-Quasi-Ordering
Combinatorics
2010-05-11 v1
Abstract
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs which are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from \cite{Ding92}, we prove that -free bipartite graphs are not wqo. On the other hand, we show that -free bipartite graphs are wqo. We also obtain some partial results on subclasses of bipartite graphs defined by forbidding more than one induced subgraph.
Keywords
Cite
@article{arxiv.1005.1328,
title = {Bipartite Induced Subgraphs and Well-Quasi-Ordering},
author = {Nicholas Korpelainen and Vadim V. Lozin},
journal= {arXiv preprint arXiv:1005.1328},
year = {2010}
}