Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userVariation of the local topological structure of graph embeddings
129
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each vertex of $G$. In this paper, we study the following problem: given a genus $g$ embedding $mathbb{E}$ of the graph $G$, if we randomly rearrange the edges around a vertex, i.e., re-embedding, what is the probability of the resulting embedding $mathbb{E}$ having genus $g+Delta g$? We give a formula to compute this probability. Meanwhile, some other known and unknown results are also obtained. For example, we show that the probability of preserving the genus is at least $frac{2}{deg(v)+2}$ for re-embedding any vertex $v$ of degree $deg(v)$ in a one-face embedding; and we obtain a necessary condition for a given embedding of $G$ to be an embedding with the minimum genus.
rate research
Read More
The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each vertex of $G$. In this paper, we study the following problem: given a genus $g$ embedding $epsilon$ of the graph $G$ and a vertex of $G$, how many different ways of reembedding the vertex such that the resulting embedding $epsilon$ is of genus $g+Delta g$? We give formulas to compute this quantity and the local minimal genus achieved by reembedding. In the process we obtain miscellaneous results. In particular, if there exists a one-face embedding of $G$, then the probability of a random embedding of $G$ to be one-face is at least $prod_{ uin V(G)}frac{2}{deg( u)+2}$, where $deg( u)$ denotes the vertex degree of $ u$. Furthermore we obtain an easy-to-check necessary condition for a given embedding of $G$ to be an embedding of minimum genus.
The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of large independent sets, of size matching the best-known asymptotics due to Shearer (1983). The present work strengthens this in two ways: first, by guaranteeing stronger graph structure in terms of colourings through applications of the Lovasz local lemma; and second, by extending beyond triangle-free graphs in terms of local sparsity, treating for example graphs of bounded local edge density, of bounded local Hall ratio, and of bounded clique number. This generalises and improves upon much other earlier work, including that of Shearer (1995), Alon (1996) and Alon, Krivelevich and Sudakov (1999), and more recent results of Molloy (2019), Bernshteyn (2019) and Achlioptas, Iliopoulos and Sinclair (2019). Our results derive from a common framework built around the hard-core model. It pivots on a property we call local occupancy, giving a clean separation between the methods for deriving graph structure with probabilistic information and verifying the requisite probabilistic information itself.
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological constructions can be used to gain information otherwise concealed by the low-dimensional nature of graphs. We do that by extending previous work of other researchers in homological persistence, by proposing novel graph-theoretical constructions. Beyond cliques, we use independent sets, neighborhoods, enclaveless sets and a Ramsey-inspired extended persistence.
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollobas-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted counts of k-valuations. In this paper, we consider a multivariate generating function of k-valuations. We show that this is a polynomial in k and hence defines a graph polynomial. We then show that the resulting polynomial has several desirable properties, including a recursive deletion-contraction-type definition, and specialises to the graph polynomials mentioned above. It also offers an alternative extension of the Penrose polynomial from plane graphs to graphs in other surfaces.
A $ k $-page book drawing of a graph $ G $ is a drawing of $ G $ on $ k $ halfplanes with common boundary $ l $, a line, where the vertices are on $ l $ and the edges cannot cross $ l $. The $ k $-page book crossing number of the graph $ G $, denoted by $ u_k(G) $, is the minimum number of edge-crossings over all $ k $-page book drawings of $ G $. Let $G=K_n$ be the complete graph on $n$ vertices. We improve the lower bounds on $ u_k(K_n) $ for all $ kgeq 14 $ and determine $ u_k(K_n) $ whenever $ 2 < n/k leq 3 $. Our proofs rely on bounding the number of edges in convex graphs with small local crossing numbers. In particular, we determine the maximum number of edges that a convex graph with local crossing number at most $ ell $ can have for $ ellleq 4 $.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
