A unified view of determinantal expansions for Jack polynomials.
A uniform approach to complexes arising from forests.
A uniformly distributed statistic on a class of lattice paths.
A uniqueness result for -homogeneous latin trades
A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A -homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either or times. In this paper, we show that a construction given by Cavenagh, Donovan and Drápal for -homogeneous latin trades in fact classifies every minimal -homogeneous latin trade. We in turn classify all -homogeneous latin trades. A corollary is that any -homogeneous...
A universal class of 4-colored graphs.
A user study in similarity measures for graph drawing.
A van der Waerden variant.
A variant of the reciprocal super Catalan matrix
Recently Prodinger [8] considered the reciprocal super Catalan matrix and gave explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and obtained some related matrices. For all results, q-analogues were also presented. In this paper, we define and study a variant of the reciprocal super Catalan matrix with two additional parameters. Explicit formulæ for its LU-decomposition, LUdecomposition of its inverse and the Cholesky decomposition are obtained. For all results, q-analogues...
A variant on the graph parameters of Colin de Verdière: implications to the minimum rank of graphs.
A variation of zero-divisor graphs
A viewpoint to the minimum coloring problem of hypergraphs
A visibility representation for graphs in three dimensions.
A weighted graph polynomial from chromatic invariants of knots
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial on weighted graphs which contains as specialisations the weighted chromatic invariants but also contains many other classical invariants including the Tutte and matching polynomials. It also gives the symmetric function generalisation of the chromatic polynomial introduced by Stanley. We study its complexity and prove hardness results for very restricted classes of graphs.
A well-rounded linear function.
A WZ proof of a “curious” identity.
A invariant for greedoids and antimatroids.
A -ring Frobenius characteristic for .
A σ₃ type condition for heavy cycles in weighted graphs
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted graph which satisfies the following conditions: 1. The weighted degree sum of any three independent vertices is at least m; 2. w(xz) = w(yz) for every...
AB percolation: a brief survey
Abel's method on Summation by Parets and Nonterminating q-Series Identities.