Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition

Nathan Linial; Sria Louis

doi:10.1007/s00373-019-02116-0

Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition

Nathan Linial
, Sria Louis^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

6 Scopus citations

Abstract

An internal partition of a graph G= (V, E) is a partitioning of V into two parts such that every vertex has at least a half of its neighbors on its own side. We prove that for every positive integer r, asymptotically almost every 2r-regular graph has an internal partition. Whereas previous results in this area apply only to a small fraction of all 2r-regular graphs, ours applies to almost all of them.

Original language	English
Pages (from-to)	41-50
Number of pages	10
Journal	Graphs and Combinatorics
Volume	36
Issue number	1
DOIs	https://doi.org/10.1007/s00373-019-02116-0
State	Published - 1 Jan 2020

Bibliographical note

Publisher Copyright:
© 2019, Springer Japan KK, part of Springer Nature.

Keywords

Asymptotic
Graph partitions
Internal partition
Optimization
Satisfactory partition
Vertex degree

Access to Document

10.1007/s00373-019-02116-0

Cite this

@article{18a64483ed084fa185c084f40a629fe0,

title = "Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition",

abstract = "An internal partition of a graph G= (V, E) is a partitioning of V into two parts such that every vertex has at least a half of its neighbors on its own side. We prove that for every positive integer r, asymptotically almost every 2r-regular graph has an internal partition. Whereas previous results in this area apply only to a small fraction of all 2r-regular graphs, ours applies to almost all of them.",

keywords = "Asymptotic, Graph partitions, Internal partition, Optimization, Satisfactory partition, Vertex degree",

author = "Nathan Linial and Sria Louis",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Japan KK, part of Springer Nature.",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/s00373-019-02116-0",

language = "אנגלית",

volume = "36",

pages = "41--50",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition

AU - Linial, Nathan

AU - Louis, Sria

PY - 2020/1/1

Y1 - 2020/1/1

N2 - An internal partition of a graph G= (V, E) is a partitioning of V into two parts such that every vertex has at least a half of its neighbors on its own side. We prove that for every positive integer r, asymptotically almost every 2r-regular graph has an internal partition. Whereas previous results in this area apply only to a small fraction of all 2r-regular graphs, ours applies to almost all of them.

AB - An internal partition of a graph G= (V, E) is a partitioning of V into two parts such that every vertex has at least a half of its neighbors on its own side. We prove that for every positive integer r, asymptotically almost every 2r-regular graph has an internal partition. Whereas previous results in this area apply only to a small fraction of all 2r-regular graphs, ours applies to almost all of them.

KW - Asymptotic

KW - Graph partitions

KW - Internal partition

KW - Optimization

KW - Satisfactory partition

KW - Vertex degree

UR - https://www.scopus.com/pages/publications/85075898188

U2 - 10.1007/s00373-019-02116-0

DO - 10.1007/s00373-019-02116-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85075898188

SN - 0911-0119

VL - 36

SP - 41

EP - 50

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this