相关论文: Triangulability of Convex Graphs and Convex Skewne…

Motivated by a result of [17], we determine necessary and sufficient conditions on $F\/$ with $|E(F)| \leq n-1\/$ for which $K_n - F\/$ admits a $g$-angulation. For $|E(F)| \geq n\/$, we investigate the possibility of placing $F\/$ in…

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

We investigate a covering problem in $3$-uniform hypergraphs ($3$-graphs): given a $3$-graph $F$, what is $c_1(n,F)$, the least integer $d$ such that if $G$ is an $n$-vertex $3$-graph with minimum vertex degree $\delta_1(G)>d$ then every…

Let $G$ be a fixed graph and let ${\mathcal F}$ be a family of graphs. A subgraph $J$ of $G$ is ${\mathcal F}$-saturated if no member of ${\mathcal F}$ is a subgraph of $J$, but for any edge $e$ in $E(G)-E(J)$, some element of ${\mathcal…

A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set $F_n\subset[0,\binom{n}{3}]$ of possible number of frustrated triangles $f(G)$ in a graph $G$ on $n$ vertices. We prove…

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if every vertex in $G$ is contained in a copy of $F$. For $1\le i \le k-1$, let $c_i(n,F)$ be the least integer such that every $n$-vertex $k$-uniform…

The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…

In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

Let $G = (V,E)$ be a plane graph. A face $f$ of $G$ is guarded by an edge $vw \in E$ if at least one vertex from $\{v,w\}$ is on the boundary of $f$. For a planar graph class $\mathcal{G}$ we ask for the minimal number of edges needed to…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

A convex geometric graph $G$ is said to be packable if there exist edge-disjoint copies of $G$ in the complete convex geometric graph $K_n$ covering all but $o(n^2)$ edges. We prove that every convex geometric graph with cyclic chromatic…

Given two $r$-uniform hypergraphs $F$ and $H$, we say that $H$ has an $F$-covering if every vertex in $H$ is contained in a copy of $F$. Let $c_{i}(n,F)$ be the least integer such that every $n$-vertex $r$-graph $H$ with…

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

Let $\mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n, F)$, that are best possible up to a constant factor, when…

Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain…

For a graph $F$, we say that another graph $G$ is $F$-saturated, if $G$ is $F$-free and adding any edge to $G$ would create a copy of $F$. We study for a given graph $F$ and integer $n$ whether there exists a regular $n$-vertex…