LLT polynomials,chromatic quasisymmetric functions and graphs with cycles

We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as unicellular LLT polynomials, revealing some parallel structure and phenomena regarding their $\mathrm{e}$-positivity.The Dyck path model is also extended to circular arc digraphs to obtain larger families of polynomials, giving a new extension of LLT polynomials. Carrying over a lot of the non-circular combinatorics, we prove several statements regarding the $\mathrm{e}$-coefficients of chromatic quasisymmetric functions and LLT polynomials, including a natural combinatorial interpretation for the $\mathrm{e}$-coefficients for the line graph and the cycle graph for both families. We believe that certain $\mathrm{e}$-positivity conjectures hold in all these families above.Furthermore, beyond the chromatic analogy, we study vertical-strip LLT polynomials, which are modified Hall–Littlewood polynomials.     

Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G=T^l$ with $l\ge 1$. In this paper we prove that if every connected pentavalent symmetric $T$-vertex-transitive graph is $T$-normal, then every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal. This result, among others, implies that every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal except $T$ is one of 57 simple groups. Furthermore, every connected pentavalent symmetric $G$-regular graph is $G$-normal except $T$ is one of 20 simple groups, and every connected pentavalent $G$-symmetric graph is $G$-normal except $T$ is one of 17 simple groups.     

Ring geometries,two-weight codes,and strongly regular graphs

It is known that a projective linear two-weight code C over a finite field corresponds both to a set of points in a projective space over that meets every hyperplane in either a or b points for some integers a < b, and to a strongly regular graph whose vertices may be identified with the codewords of C. Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homogeneous weights and sets of points in an associated projective ring geometry. We will introduce regular projective two-weight codes over finite Frobenius rings, we will show that such a code gives rise to a strongly regular graph, and we will give some constructions of two-weight codes using ring geometries. All these examples yield infinite families of strongly regular graphs with non-trivial parameters.      

Preface: Old and New Perspectives on the Tutte Polynomial

This paper introduces a special issue on the Tutte polynomial derived from the Second Workshop on Tutte Polynomials and Applications, 2005, held at the Centre de Recerca Matemàtica, Bellaterra, Catalonia. We discuss the prehistory of Tutte polynomials and two current areas of research, to what extent a graph is determined by its chromatic or Tutte polynomial and generic versions of Tutte polynomials. Received February 28, 2007     

Lattice Ordered Polynomial Algebras

In this paper we define a lattice order on a set F of binary functions. We then provide necessary and sufficient conditions for the resulting algebra F to be a distributive lattice or a Boolean algebra. We also prove a Cayley theorem for distributive lattices by showing that for every distributive lattice , there is an algebra F of binary functions, such that is isomorphic to F and we show that F is a distributive lattice iff the operations and are idempotent and cummutative, showing that this result cannot be generalized to non-distributive lattices or quasilattices without changing the definitions of and . We also examine the equational properties of an Algebra for which , now defined on the set of binary -polynomials is a lattice or Boolean algebra.     

对称群上Cayley图的连通性

本文研究限制性边连通度的λ′-原子．运用所得结果可以证明Cayley图C(Sn,S)是最优超-λ的．这里Sn是n次对称群,S是若干由奇置换构成的共轭类的并，另外，我们还证明了C(Sn，S)是Vosperian的．除非它是完全二部图．     

Color-critical graphs have logarithmic circumference

A graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G itself is not. We prove that every k-critical graph on n vertices has a cycle of length at least , improving a bound of Alon, Krivelevich and Seymour from 2000. Examples of Gallai from 1963 show that the bound cannot be improved to exceed . We thus settle the problem of bounding the minimal circumference of k-critical graphs, raised by Dirac in 1952 and Kelly and Kelly in 1954.     

Triangular line graphs and word sense disambiguation

Linguists often represent the relationships between words in a collection of text as an undirected graph G=(V,E), where V is the vocabulary and vertices are adjacent in G if and only if the words that they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph. However, many words have several distinct meanings, preventing components from characterizing distinct semantic fields. This paper examines how the structural properties of triangular line graphs motivate the use of a clustering coefficient on the triangular line graph, thereby helping to identify polysemous words. The triangular line graph of G, denoted by T(G), is the subgraph of the line graph of G where two vertices are adjacent if the corresponding edges in G belong to a K₃.