Related papers: Higher-order Cheeger inequalities for graphons
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…
There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree…
A classification is given of all the countable homogeneous ordered bipartite graphs.
Some inequalities for different types of convexity are established.
K\"orner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Later it turned out that it can be expressed as the solution…
In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality. The result was first discovered as a consequence of the classical Forster's…
Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic…
We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985…
This note presents families of inequalities for the Gaussian measure of convex sets which extend the recently proven Gaussian correlation inequality in various directions.
We classify the Cohen-Macaulay weighted oriented graphs whose underlying graphs have girth at least $5$.
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a…
In this note, we present several inequalities in the context of pattern containment, utilizing elementary applications of the Fortuin-Kasteleyn-Ginibre (FKG) inequality and Shearer's lemma.
We apply the quotient graph theory described by Band, Berkolaiko, Joyner and Liu to particular graphs symmetric with respect to $S_3$ and $C_3$ symmetry groups. We find the quotient graphs for the three-edge star quantum graph with Neumann…
Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve…
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…
In the paper we prove generalization of Schl\"omilch's and Zetel's theorems about concurrent lines in a triangle. This generalization is obtained as a corollary of sharp geometric inequality about the ratio of triangular areas which is…
We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…
Interval graphs and proper interval graphs are well known graph classes, for which several generalizations have been proposed in the literature. In this work, we study the (proper) thinness, and several variations, for the classes of…
We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.