Enumerative Properties of Ferrers Graphs
نویسندگان
چکیده
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial and the chromatic symmetric function. We show that the linear coefficient of the chromatic polynomial is given by the excedance set statistic.
منابع مشابه
Algebraic Properties of Edge Ideals via Combinatorial Topology
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature regarding linearity, Betti numbers, and (sequentially) Cohen-Macaulay properties of edges ideals associated to chordal, complements of chordal, and Ferrers g...
متن کاملDerangements on a Ferrers board
We study the derangement number on a Ferrers board B = (n × n) − λ with respect to an initial permutation M , that is, the number of permutations on B that share no common points with M . We prove that the derangement number is independent of M if and only if λ is of rectangular shape. We characterize the initial permutations that give the minimal and maximal derangement numbers for a general F...
متن کاملFerrers Graphs and Related Ideals
This abstract is essentially taken from the introduction of the paper Monomial and toric ideals associated to Ferrers graphs [13], written jointly with Alberto Corso. A Ferrers graph is a bipartite graph on two distinct vertex sets X = {x1, . . . , xn} and Y = {y1, . . . , ym} such that if (xi, yj) is an edge of G, then so is (xp, yq) for 1 ≤ p ≤ i and 1 ≤ q ≤ j. In addition, (x1, ym) and (xn, ...
متن کاملSpecializations of Ferrers ideals
We introduce a specialization technique in order to study monomial ideals that are generated in degree two by using our earlier results about Ferrers ideals. It allows us to describe explicitly a cellular minimal free resolution of various ideals including any strongly stable and any squarefree strongly stable ideal whose minimal generators have degree two. In particular, this shows that thresh...
متن کاملar X iv : 0 80 8 . 23 07 v 1 [ m at h . C O ] 1 7 A ug 2 00 8 BOOLEAN COMPLEXES FOR FERRERS GRAPHS
Ferrers graphs are bipartite graphs that correspond naturally to Ferrers shapes. In this paper, we determine the homotopy type of the boolean complex of Ferrers graphs. Previous work of the last two authors shows that the boolean complex of a graph is a wedge of spheres of maximal dimension. Thus the homotopy type of this complex depends entirely on the number of spheres in the wedge sum, calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 32 شماره
صفحات -
تاریخ انتشار 2004