Graph Minors. XX. Wagner's conjecture
@article{ROBSEY04, abstract = {We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.}, author = {Robertson, Neil and Seymour, Paul D.}, doi = {10.1016/j.jctb.2004.08.001}, issn = {0095-8956}, journal = {Journal of Combinatorial Theory, Series B}, keywords = {Graph, Minor, Surface embedding, Well-quasi-ordering}, note = {Special Issue Dedicated to Professor W.T. Tutte}, number = {2}, pages = {325-357}, sha256 = {3f39a2bf0802358e910ff39e6e92aa884bd2112ee84615c0228d3b943653e82e}, title = {Graph Minors. XX. Wagner's conjecture}, url = {https://www.sciencedirect.com/science/article/pii/S0095895604000784}, volume = {92}, year = {2004} }