Related papers: Forbidden Four Cycle, Star Graphs and Isometric Em…
We show that there are planar graphs that require four pages in any book embedding.
We characterise the pairs of graphs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are perfect. Similarly, we characterise pairs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are…
We describe isometric embeddings of polar Grassmann graphs formed by non-maximal singular subspaces. In almost all cases, they are induced by collinearity preserving injections of polar spaces. As a simple consequence of this result, we get…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds…
Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…
We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…
Whether embedding spaces use all their dimensions equally, i.e., whether they are isotropic, has been a recent subject of discussion. Evidence has been accrued both for and against enforcing isotropy in embedding spaces. In the present…
In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…
A large body of research in graph theory concerns the induced subgraphs of graphs with large chromatic number, and especially which induced cycles must occur. In this paper, we unify and substantially extend results from a number of…
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a…
The concept of quasi-isometric embedding maps between $*$-algebras is introduced. We have obtained some basic results related to this notion and similar to quasi-isometric embedding maps on metric spaces, under some conditions, we give a…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…
We define the class of admissible linear embeddings of flag varieties. The definition is given in the general language of algebraic geometry. We then prove that an admissible linear embedding of flag varieties has a certain explicit form in…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
In this manuscript, we investigate the behavior of stellar structure through embedding approach in $f(R, \phi, X)$ modified theory of gravity, where $R$ denotes the Ricci scalar, $\phi$ represents the scalar potential and $X$ indicates the…