English
Related papers

Related papers: The maximum and minimum genus of a multibranched s…

200 papers

We prove that every graph $G$ for which $\omega(G) \geq 3/4(\Delta(G) + 1)$, has an independent set $I$ such that $\omega(G - I) < \omega(G)$. It follows that a minimum counterexample $G$ to Reed's conjecture satisfies $\omega(G) <…

Combinatorics · Mathematics 2010-03-16 Landon Rabern

A $t$-bar visibility representation of a graph assigns each vertex up to $t$ horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex can see some bar for the other via an unobstructed vertical…

Combinatorics · Mathematics 2019-04-19 Yuanrui Feng , Douglas B. West , Yan Yang

We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.

Algebraic Geometry · Mathematics 2016-09-01 Neelav Dutta , David Jensen

A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of…

Discrete Mathematics · Computer Science 2012-10-26 Vahan V. Mkrtchyan , Eckhard Steffen

In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $\gamma_{\times 2}(G)$ is…

Combinatorics · Mathematics 2021-07-08 Wei Zhuang

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

Combinatorics · Mathematics 2017-07-18 Vida Dujmović , David Eppstein , David R. Wood

We show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.

Discrete Mathematics · Computer Science 2020-01-17 François Dross

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…

Combinatorics · Mathematics 2014-07-08 Andrei Gagarin , Vadim Zverovich

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\Delta(G)$…

Combinatorics · Mathematics 2012-10-26 Jia Huang

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…

Combinatorics · Mathematics 2007-05-23 Tao Jiang , Dhruv Mubayi , Aditya Shastri , Douglas B. West

O and Shi proved that the Randi\'c index of any graph $G$ with minimum degree at least $\delta$ and maximum degree at most $\Delta$ is at least $\frac{\sqrt{\delta\Delta}}{\delta+\Delta}|G|$, with equality if and only if the graph is…

Combinatorics · Mathematics 2024-04-03 John Haslegrave

In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum…

Combinatorics · Mathematics 2015-05-13 Han Ren , Hongtao Zhao , Haoling Li

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Combinatorics · Mathematics 2007-05-23 Niranjan Balachandran , Niraj Khare

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

Combinatorics · Mathematics 2013-09-02 Isidoro Gitler , Carlos E. Valencia

We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…

Combinatorics · Mathematics 2025-02-11 János Barát , Zoltán L. Blázsik , Balázs Keszegh , Zeyu Zheng

Using the local picture of the degeneration of sequences of minimal surfaces developed by Chodosh, Ketover and Maximo we show that in any closed Riemannian 3-manifold $(M,g)$, the genus of an embedded CMC surface can be bounded only in…

Differential Geometry · Mathematics 2021-05-26 Artur B. Saturnino

In this paper, we consider a connected orientable closed Riemannian manifold $M^{n+1}$ with positive Ricci curvature. Suppose $G$ is a compact Lie group acting by isometries on $M$ with $3\leq {\rm codim}(G\cdot p)\leq 7$ for all $p\in M$.…

Differential Geometry · Mathematics 2024-10-09 Tongrui Wang

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

Group Theory · Mathematics 2022-05-13 Tony N. Mavely , Viji Z. Thomas

Let $M$ be an orientable 3-manifold with $\partial M$ a single torus. We show that the number of boundary slopes of immersed essential surfaces with genus at most $g$ is bounded by a quadratic function of $g$. In the hyperbolic case, this…

Geometric Topology · Mathematics 2009-06-12 Tao Li , Ruifeng Qiu , Shicheng Wang