English
Related papers

Related papers: Absorbing angles, Steiner minimal trees, and antip…

200 papers

Let $d,m_1,...,m_r$ be ($r+1$) positive integers, and $P_1,...,P_r$ be $r$ general points in the projective plane ; let $m$ be a positive integer. We prove that there exists a bound $d_0(m)$ such that : If $m_i < m$ ($0<i<r+1$), and $d >…

Algebraic Geometry · Mathematics 2007-05-23 Thierry Mignon

The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph $G$ with ${n+1\choose 2}$ edges admits an edge decomposition $G=H_1\oplus\cdots \oplus H_n$ such that $H_i$ has $i$ edges and it is isomorphic to a subgraph of…

Combinatorics · Mathematics 2015-12-08 Anna Lladó , Josep Maria Aroca

We prove the existence and uniqueness of harmonic maps in degree one homotopy classes of closed, orientable surfaces of positive genus, when the target has conic points with cone angles less than $2\pi$. For a cone point $p$ of cone angle…

Analysis of PDEs · Mathematics 2011-08-02 Jesse Gell-Redman

We prove that every graph with sufficiently large minimum degree $d$ contains a spanning forest in which every component is a star of size at least $\sqrt{d} - \tilde O(d^{1/4})$. This improves the result of Alon and Wormald and is optimal…

Combinatorics · Mathematics 2016-11-16 Rajko Nenadov

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k,\ell}$ in digraphs of given size, where the center of the star has out-degree $k$ and in-degree $\ell$. The case $k\ell=0$ was solved by Huang.…

Combinatorics · Mathematics 2020-08-13 Ping Hu , Jie Ma , Sergey Norin , Hehui Wu

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

Combinatorics · Mathematics 2021-10-12 Luyining Gan , Jie Han , Lin Sun , Guanghui Wang

We prove that a connected properly immersed minimal surface in Euclidean 3-space with infinite symmetry group whose intersection with a ball of radius R is less than 2\piR^2 is a plane, a catenoid or a Scherk singly-periodic minimal…

Differential Geometry · Mathematics 2007-05-23 William H. Meeks , Michael Wolf

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

Logic · Mathematics 2019-10-02 Pantelis E. Eleftheriou

We consider minimising $p$-harmonic maps from three-dimensional domains to the real projective plane, for $1<p<2$. These maps arise as least-energy configurations in variational models for nematic liquid crystals. We show that the singular…

Analysis of PDEs · Mathematics 2019-12-02 Giacomo Canevari , Giandomenico Orlandi

A geometric $t$-spanner $\mathcal{G}$ on a set $S$ of $n$ point sites in a metric space $P$ is a subgraph of the complete graph on $S$ such that for every pair of sites $p,q$ the distance in $\mathcal{G}$ is a most $t$ times the distance…

Computational Geometry · Computer Science 2024-09-20 Sarita de Berg , Tim Ophelders , Irene Parada , Frank Staals , Jules Wulms

The Steiner distance of vertices in a set $S$ is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets $S$ of cardinality $k$ is called the Steiner $k$-Wiener index and studied…

Combinatorics · Mathematics 2020-08-06 Jie Zhang , Hua Wang , Xiao-Dong Zhang

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…

Combinatorics · Mathematics 2025-09-23 Junying Lu , Yaojun Chen

We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…

We prove that several natural graph classes have tree-decompositions with minimum width such that each bag has bounded treewidth. For example, every planar graph has a tree-decomposition with minimum width such that each bag has treewidth…

Combinatorics · Mathematics 2025-12-01 Kevin Hendrey , David R. Wood

A tree T_uni is m-universal for the class of trees if for every tree T of size m, T can be obtained from T_uni by successive contractions of edges. We prove that a m-universal tree for the class of trees has at least mln(m) + (gamma-1)m +…

Discrete Mathematics · Computer Science 2009-11-17 Olivier Bodini

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Combinatorics · Mathematics 2007-05-23 Zoltan Furedi , Dhruv Mubayi , Douglas B. West

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

Combinatorics · Mathematics 2022-07-21 Bruce Reed , Maya Stein

In this paper, we investigate what selection principles properties are possessed by small (with respect to the bounding and dominating numbers) unions of spaces with certain (star) selection principles.. Furthermore, we give several results…

General Topology · Mathematics 2022-11-01 Javier Casas-de la Rosa , William Chen-Mertens , Sergio Garcia-Balan

We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…

Combinatorics · Mathematics 2021-03-02 Zoltán Lóránt Nagy , Levente Szemerédi

We study a concrete family of symmetric integral $Z$-matrices attached to weighted star trees. The arms are ordinary type-$A$ chains and the central diagonal entry is an arbitrary positive integer $k$ rather than being fixed to the Cartan…

Combinatorics · Mathematics 2026-05-25 Emilio Torrente-Lujan
‹ Prev 1 4 5 6 7 8 10 Next ›