An extremal theorem in the hypercube.
An identity between the determinant and the permanent of Hessenberg-type matrices
In this short note we provide an extension of the notion of Hessenberg matrix and observe an identity between the determinant and the permanent of such matrices. The celebrated identity due to Gibson involving Hessenberg matrices is consequently generalized.
An identity for fixed points of permutations.
An identity for the independence polynomials of trees.
An identity generator: basic commutators.
An identity in Rota-Baxter algebras.
An Implicit Weighted Degree Condition For Heavy Cycles
For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains...
An improved bound on the minimal number of edges in color-critical graphs.
An improved inductive definition of two restricted classes of triangulations of the plane
An improved tableau criterion for Bruhat order.
An improvement to Mathon's cyclotomic Ramsey colorings.
An inductive proof of Whitney's Broken Circuit Theorem
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.
An inequality chain of domination parameters for trees
We prove that the smallest cardinality of a maximal packing in any tree is at most the cardinality of an R-annihilated set. As a corollary to this result we point out that a set of parameters of trees involving packing, perfect neighbourhood, R-annihilated, irredundant and dominating sets is totally ordered. The class of trees for which all these parameters are equal is described and we give an example of a tree in which most of them are distinct.
An inequality concerning edges of minor weight in convex 3-polytopes
Let be the number of edges in a convex 3-polytope joining the vertices of degree i with the vertices of degree j. We prove that for every convex 3-polytope there is ; moreover, each coefficient is the best possible. This result brings a final answer to the conjecture raised by B. Grünbaum in 1973.
An inequality related to two integer sequences satisfying an order condition.
An inequality related to Vizing's conjecture.
An infinite antichain of permutations.
An infinite family of dual sequence identities.
An infinite family of graphs with the same Ihara Zeta function.
An Infinite Family of Minor-Minimal Nonrealizable 3-Chirotopes.