Feed Search Library Collections

Every rayless graph has an unfriendly partition

Abstract

We prove that every rayless graph has an unfriendly partition.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…

arXiv:0901.4858

Published January 30, 2009

Authors

HBHenning Bruhn
RDReinhard Diestel
AGAgelos Georgakopoulos
PSPhilipp Sprüssel

Comment: Final, slightly modified, version. To appear in combinatorica

Updated: December 21, 2009

Latest Papers Trending Top Today Top This Week AI Papers Machine Learning Computer Vision NLP Statistics ML Optimization

ArcXiv is an independent project and is not affiliated with arXiv or Cornell University. Metadata-only — PDFs link to arXiv.arxiv.org