Unfriendly partitions for graphs not containing a subdivision of an infinite clique

Eli Berger

doi:10.1007/s00493-015-3261-1

Unfriendly partitions for graphs not containing a subdivision of an infinite clique

Eli Berger

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.

Original language	American English
Pages (from-to)	157-166
Number of pages	10
Journal	Combinatorica
Volume	37
Issue number	2
DOIs	https://doi.org/10.1007/s00493-015-3261-1
State	Published - 1 Apr 2017

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/s00493-015-3261-1

Cite this

@article{f28135c8a86f4ea1b062a088f16bad87,

title = "Unfriendly partitions for graphs not containing a subdivision of an infinite clique",

abstract = "We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.",

author = "Eli Berger",

note = "Publisher Copyright: {\textcopyright} 2017, J{\'a}nos Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.",

year = "2017",

month = apr,

day = "1",

doi = "10.1007/s00493-015-3261-1",

language = "American English",

volume = "37",

pages = "157--166",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "2",

}

TY - JOUR

T1 - Unfriendly partitions for graphs not containing a subdivision of an infinite clique

AU - Berger, Eli

PY - 2017/4/1

Y1 - 2017/4/1

N2 - We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.

AB - We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.

UR - http://www.scopus.com/inward/record.url?scp=85012118500&partnerID=8YFLogxK

U2 - 10.1007/s00493-015-3261-1

DO - 10.1007/s00493-015-3261-1

M3 - Article

SN - 0209-9683

VL - 37

SP - 157

EP - 166

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

Unfriendly partitions for graphs not containing a subdivision of an infinite clique

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this