English
Related papers

Related papers: Compact minimal vertical graphs with non-connected…

200 papers

We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture of F\"{u}redi and Ruszink\'{o}. We also…

Combinatorics · Mathematics 2021-04-02 Lior Gishboliner , Asaf Shapira

We prove that any non-simply connected planar domain can be properly and minimally embedded in H^2 x R. The examples that we produce are vertical bi-graphs, and they are obtained from the conjugate surface of a Jenkins-Serrin graph.

Differential Geometry · Mathematics 2011-06-24 Francisco Martín , M. Magdalena Rodríguez

We prove that nonlocal minimal graphs in the plane exhibit generically stickiness effects and boundary discontinuities. More precisely, we show that if a nonlocal minimal graph in a slab is continuous up to the boundary, then arbitrarily…

Analysis of PDEs · Mathematics 2020-06-24 Serena Dipierro , Ovidiu Savin , Enrico Valdinoci

We study complete minimal graphs in HxR, which take asymptotic boundary values plus and minus infinity on alternating sides of an ideal inscribed polygon Γ in H. We give necessary and sufficient conditions on the "lenghts" of the sides…

Differential Geometry · Mathematics 2007-05-23 Pascal Collin , Harold Rosenberg

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and…

Combinatorics · Mathematics 2013-01-24 Michael S. Payne , Attila Pór , Pavel Valtr , David R. Wood

We introduce and study level-planar straight-line drawings with a fixed number $\lambda$ of slopes. For proper level graphs, we give an $O(n \log^2 n / \log \log n)$-time algorithm that either finds such a drawing or determines that no such…

Data Structures and Algorithms · Computer Science 2019-08-02 Guido Brückner , Nadine Davina Krisam , Tamara Mchedlidze

A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…

Combinatorics · Mathematics 2023-08-07 Andrea C. Burgess , Robert D. Luther , David A. Pike

Given a graph family $\mathbb{H}$, let ${\rm SPEX}(n,\mathbb{H}_{\rm sub})$ denote the set of $n$-vertex $\mathbb{H}$-subdivision-free graphs with the maximum spectral radius. In this paper, we investigate the problem of graph subdivision…

Combinatorics · Mathematics 2025-07-08 Wanting Sun , Guanghui Wang , Pingchuan Yang

We prove some non-existence results for the asymptotic Plateau problem of minimal and area minimizing surfaces in the homogeneous space ${\widetilde{\mathrm{SL}}_2(\mathbb{R})}$ with isometry group of dimension 4, in terms of their…

Differential Geometry · Mathematics 2022-07-22 Jesús Castro-Infantes

We study the asymptotic Dirichlet problem for the minimal graph equation on a Cartan-Hadamard manifold $M$ whose radial sectional curvatures outside a compact set satisfy an upper bound $$K(P)\le - \frac{\phi(\phi-1)}{r(x)^2}$$ and a…

Differential Geometry · Mathematics 2016-06-01 Jean-Baptiste Casteras , Esko Heinonen , Ilkka Holopainen

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

Given $H\in [0,\infty),$ some sufficient conditions for existence of CMC $H$ graphs with boundary in two parallel planes of $\mathbb{H}^2\times\mathbb{R}$ are presented. Height estimates for outwards-oriented CMC surfaces…

Differential Geometry · Mathematics 2015-12-25 Rodrigo Soares , Patrícia Klaser , Miriam Telichevesky

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

Combinatorics · Mathematics 2020-06-22 Fabrizio Frati , Michael Hoffmann , Csaba D. Tóth

We study the asymptotic Plateau problem in $\mathbb{H}_2\times \mathbb{R}$. We give the first examples of non-fillable finite curves with no thin tail in the asymptotic cylinder. Furthermore, we study the fillability question for infinite…

Differential Geometry · Mathematics 2023-02-20 Baris Coskunuzer

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

Differential Geometry · Mathematics 2023-05-22 Allen Weitsman

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

Combinatorics · Mathematics 2025-02-20 A. R. Akhiiarov , A. V. Bobu , A. M. Raigorodskii

For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. We prove that $H$-free Edge Deletion is NP-complete…

Data Structures and Algorithms · Computer Science 2015-09-15 N. R. Aravind , R. B. Sandeep , Naveen Sivadasan

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

Combinatorics · Mathematics 2012-07-30 Fan Chung , Yong Lin , Shing-Tung Yau

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

Rings and Algebras · Mathematics 2007-05-23 Tongsuo Wu , Li Chen

Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon n$ edges from $G$ to make it $H$-minor free (for some small constant $\varepsilon > 0$). We give an…

Discrete Mathematics · Computer Science 2018-08-29 Akash Kumar , C. Seshadhri , Andrew Stolman