Related papers: Free Minor Closed Classes and the Kuratowski theor…
We investigate the Hamiltonian structure of a class of gravitational theories whose actions are linear in the lapse function. We derive the necessary and sufficient condition for a theory in this class to have two or less local physical…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built.
Problem of finding an optimal upper bound for the chromatic no. of a graph is still open and very hard. Borodin and Kostochka Conjecture is still open and if proved will improve Brook bound on Chromatic no. of a graph. Here we prove Borodin…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
We present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing graphs with large treewidth in terms of their induced…
One version of Whitehead's famous cut vertex lemma says that if an element of a free group is part of a free basis, then a certain graph associated to its conjugacy class that we call the star graph is either disconnected or has a cut…
This is a joint introduction to classical and free probability, which are twin sisters. We first review the foundations of classical probability, notably with the main limiting theorems (CLT, CCLT, PLT, CPLT), and with a look into examples…
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph is defined as a pair $(G, \chi),$ where $G$ is a graph and $\chi$ assigns to each vertex a (possibly empty)…
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…
We review remarkable results in several mathematical scenarios, including graph theory, division algebras, cross product formalism and matroid theory. Specifically, we mention the following subjects: (1) the Euler relation in graph theory,…
The celebrated Hadwiger's conjecture states that if a graph contains no $K_{t+1}$ minor then it is $t$-colourable. If true, it would in particular imply that every $n$-vertex $K_{t+1}$-minor-free graph has an independent set of size at…
In this note we show that abstract planar algebras are algebras over the topological operad of moduli spaces of stable maps with Lagrangian boundary conditions, which in the case of the projective line are described in terms of real…