Related papers: Analysis of the Lifting Graph

Network detection is an important capability in many areas of applied research in which data can be represented as a graph of entities and relationships. Oftentimes the object of interest is a relatively small subgraph in an enormous,…

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

The Blow-up Lemma established by Koml\'os, S\'ark\"ozy, and Szemer\'edi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the…

Let $G$ and $H$ be simple 3-connected graphs such that $G$ has an $H$-minor. An edge $e$ in $G$ is called {\it $H$-deletable} if $G\backslash e$ is 3-connected and has an $H$-minor. The main result in this paper establishes that, if $G$ has…

Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and is an important notion in theoretical computer science.…

The observation, design and analysis of mesh-like networks in bionics, polymer physics and biological systems has brought forward an extensive catalog of fascinating structures of which a subgroup share a particular, yet critically under…

A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w:V(G) \longrightarrow\mathbb{R}$ be a weight function. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. An…

Let $\Lambda(T)$ denote the set of leaves in a tree $T$. One natural problem is to look for a spanning tree $T$ of a given graph $G$ such that $\Lambda(T)$ is as large as possible. This problem is called maximum leaf number, and it is a…

We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…

Learning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the…

We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…

The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…

Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…

A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing- criticality a property that is inherent to the structure of a…

A stable cutset is a set of vertices $S$ of a connected graph, that is pairwise non-adjacent and when deleting $S$, the graph becomes disconnected. Determining the existence of a stable cutset in a graph is known to be NP-complete. In this…

Topological flat bands, such as the band in twisted bilayer graphene, are becoming a promising platform to study topics such as correlation physics, superconductivity, and transport. In this work, we introduce a generic approach to…

A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-graph} is a graph whose edge set can be decomposed into two…