Related papers: A note on vertex partitions

Let $n\geq 6,k\geq 0$ be two integers. Let $H$ be a graph of order $n$ with $k$ components, each of which is an even cycle of length at least $6$ and $G$ be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|\geq n/2$. In this…

An old result by Shearer relates the Lov\'asz Local Lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard core lattice gas on graphs. We use this…

Let $G$ be a uniformly chosen simple (labelled) random graph with given degree sequence $\boldsymbol{d}$ and let $X,Y,L$ be edge-disjoint graphs on the same vertex set as $G$. We investigate the probability that $X \subseteq G$ and that $G…

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…

In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. S\'os proposed a question that if we consider only the number of edges…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

Lov\'{a}sz et al. proved that every $6$-edge-connected graph has a nowhere-zero $3$-flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3$-flow that extends the flow prescribed on the incident…

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…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

An edge colouring of a graph is said to be an $r$-local colouring if the edges incident to any vertex are coloured with at most $r$ colours. Generalising a result of Bessy and Thomass\'e, we prove that the vertex set of any $2$-locally…

Kneser's 1955 conjecture -- proven by Lov\'asz in 1978 -- asserts that in any partition of the $k$-subsets of $\{1, 2, \dots, n\}$ into $n-2k-3$ parts, one part contains two disjoint sets. Schrijver showed that one can restrict to…

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erd\"os-Simonovits and…

In this paper, extending the recent work of authors with Calles Loperena and Dimitrijevi\'c Blagojevi\'c, we give a general and complete treatment of a problem of partition of mass assignments with prescribed arrangements of hyperplanes on…

We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…

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…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…