Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We investigate the inner vertex-isoperimetric problem on the d-regular tree T d. For each integer k ≥ 1, we determine the exact value of the inner vertex-isoperimetric profile I d (k) = min{|∂D| | D ⊂ T d finite and connected, |D| = k}. We introduce a boundary invariant, called the boundary branching excess τ (D), and show that it provides a simple criterion for optimality. A domain D ⊂ T d is isoperimetrically optimal if and only if τ (D) ≤ d − 2. Finally, we show that every domain in T d admits a canonical decomposition as an iterated gluing of full domains, namely domains whose entire boundary consists of leaves. This yields a complete description of all inner vertex-isoperimetric minimizers in T d .