中文
相关论文

相关论文: Pi/2-Angle Yao Graphs are Spanners

200 篇论文

In this paper we introduce Yoke graphs, a family of flip graphs that generalizes several previously studied families of graphs: colored triangle free triangulations, arc permutations and caterpillars. Our main result is the computation of…

组合数学 · 数学 2020-08-06 Roy H. Jennings

A spanner of a graph is a subgraph that preserves lengths of shortest paths up to a multiplicative distortion. For every $k$, a spanner with size $O(n^{1+1/k})$ and stretch $(2k+1)$ can be constructed by a simple centralized greedy…

数据结构与算法 · 计算机科学 2023-07-10 Rubi Arviv , Lily Chung , Reut Levi , Edward Pyne

We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head, and the y-coordinates of the vertices are integers. The…

Let X be the blow-up of a smooth projective 4-fold Y along a smooth curve C and let E be the exceptional divisor. Assume that X is a Fano manifold and has an elementary extremal contraction $\phi: X \to Z$ of (3,1)-type such that E is…

代数几何 · 数学 2007-10-10 Toru Tsukioka

A 2-factor of a graph $G$ is a 2-regular spanning subgraph of $G$. We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various researchers in recent years.

组合数学 · 数学 2024-08-16 D. Labbate , F. Romaniello

The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |,…

计算几何 · 计算机科学 2017-07-31 Daniel Gonçalves , Lucas Isenmann , Claire Pennarun

In this draft we prove an interesting structural property related to the problem of computing {\em all the best swap edges} of a {\em tree spanner} in unweighted graphs. Previous papers show that the maximum stretch factor of the tree where…

离散数学 · 计算机科学 2018-07-11 Davide Bilò , Kleitos Papadopoulos

We compute form factors in planar N=4 Super Yang-Mills at strong coupling. Namely we consider the overlap between an operator insertion and 2n gluons. Through the gauge/string duality these are given by minimal surfaces in AdS space. The…

高能物理 - 理论 · 物理学 2010-11-26 Juan Maldacena , Alexander Zhiboedov

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…

组合数学 · 数学 2024-04-09 Kenta Noguchi , Katsuhiro Ota , Yusuke Suzuki

Let $a,b$ be positive integers with $a\ge b$. A graph $G$ is $(a,b)$-choosable if, for every assignment of lists $L(v)$ of size $a$ to the vertices of $G$, there exists a choice of subsets $C(v)\subseteq L(v)$ with $|C(v)|=b$ for each $v$…

组合数学 · 数学 2026-02-17 Xiaolan Hu , Rongxing Xu

Graph spanners are well-studied and widely used both in theory and practice. In a recent breakthrough, Chechik and Wulff-Nilsen [CW18] improved the state-of-the-art for light spanners by constructing a $(2k-1)(1+\epsilon)$-spanner with…

数据结构与算法 · 计算机科学 2022-01-20 Stephen Alstrup , Søren Dahlgaard , Arnold Filtser , Morten Stöckel , Christian Wulff-Nilsen

The planar three-gluon form factor for the chiral stress tensor operator in planar maximally supersymmetric Yang-Mills theory is an analog of the Higgs-to-three-gluon scattering amplitude in QCD. The amplitude (symbol) bootstrap program has…

高能物理 - 理论 · 物理学 2025-04-17 Tianji Cai , François Charton , Kyle Cranmer , Lance J. Dixon , Garrett W. Merz , Matthias Wilhelm

Let $(V,\delta)$ be a finite metric space, where $V$ is a set of $n$ points and $\delta$ is a distance function defined for these points. Assume that $(V,\delta)$ has a constant doubling dimension $d$ and assume that each point $p\in V$ has…

数据结构与算法 · 计算机科学 2010-02-03 David Peleg , Liam Roditty

Gao and Richter (1994) showed that every $3$-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most $2$ times. Brunet, Ellingham, Gao, Metzlar, and Richter (1995) extended…

组合数学 · 数学 2017-12-19 Morteza Hasanvand

We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The $3$-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains…

组合数学 · 数学 2016-02-22 M. N. Ellingham , Emily A. Marshall , Kenta Ozeki , Shoichi Tsuchiya

In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then $G$ has at most $10$ vertices, and…

组合数学 · 数学 2024-09-23 Xiaonan Liu , Linyuan Lu , Zhiyu Wang

This article proves the existence and uniqueness of a subfactor planar algebra with principal graph consisting of a diamond with arms of length 2 at opposite sides, which we call 2D2. We also prove the uniqueness of the subfactor planar…

算子代数 · 数学 2015-09-03 Scott Morrison , David Penneys

If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…

经典分析与常微分方程 · 数学 2025-06-10 Darrin Speegle

The main result of this article is the decomposition of tensor products of representations of SL(2) in the sum of irreducible representations parametrized by outerplanar graphs. An outerplanar graph is a graph with the vertices 0, 1, 2,…

表示论 · 数学 2007-05-23 Aleksandrs Mihailovs

Following the pioneering work of Iommi-Kiwi and Jenkinson-Pollicott-Vytnova, we continue to study the inflection points of the Lyapunov spectrum in this work. We prove that for any 3-branch piecewise linear expanding map on an interval, the…

动力系统 · 数学 2021-12-08 Liangang Ma