On the local profiles of trees

Sébastien Bubeck; Nati Linial

doi:10.1002/jgt.21865

On the local profiles of trees

Sébastien Bubeck
, Nati Linial

The Rachel and Selim Benin School of Engineering and Computer Science

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

11 Scopus citations

Abstract

We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open.

Original language	English
Pages (from-to)	109-119
Number of pages	11
Journal	Journal of Graph Theory
Volume	81
Issue number	2
DOIs	https://doi.org/10.1002/jgt.21865
State	Published - 1 Feb 2016

Bibliographical note

Publisher Copyright:
© 2015 Wiley Periodicals, Inc.

Access to Document

10.1002/jgt.21865

Cite this

@article{a9b7c14e1e634e6a9e11f19f0f472a55,

title = "On the local profiles of trees",

abstract = "We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open.",

author = "S{\'e}bastien Bubeck and Nati Linial",

note = "Publisher Copyright: {\textcopyright} 2015 Wiley Periodicals, Inc.",

year = "2016",

month = feb,

day = "1",

doi = "10.1002/jgt.21865",

language = "אנגלית",

volume = "81",

pages = "109--119",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

T1 - On the local profiles of trees

AU - Bubeck, Sébastien

AU - Linial, Nati

PY - 2016/2/1

Y1 - 2016/2/1

N2 - We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open.

AB - We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open.

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

U2 - 10.1002/jgt.21865

DO - 10.1002/jgt.21865

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

AN - SCOPUS:84924439904

SN - 0364-9024

VL - 81

SP - 109

EP - 119

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 2

ER -

On the local profiles of trees

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this