Duality of Graded Graphs

@article{Fomin1994DualityOG,
  title={Duality of Graded Graphs},
  author={Sergey Fomin},
  journal={Journal of Algebraic Combinatorics},
  year={1994},
  volume={3},
  pages={357-404}
}
AbstractA graph is said to be graded if its vertices are divided into levels numbered by integers, so that the endpoints of any edge lie on consecutive levels. Discrete modular lattices and rooted trees are among the typical examples. The following three types of problems are of interest to us:(1) path counting in graded graphs, and related combinatorial identities;(2) bijective proofs of these identities;(3) design and analysis of algorithms establishing corresponding bijections.This article… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 77 CITATIONS

Structural aspects of differential posets

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

GRADED POSETS ZETA MATRIX FORMULA

VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Young-Fibonacci insertion, tableauhedron and Kostka numbers

  • J. Comb. Theory, Ser. A
  • 2009
VIEW 17 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Induced Subgraph Order on Unlabelled Graphs

  • Electr. J. Comb.
  • 2006
VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Combinatorics of Ribbon Tableaux

VIEW 8 EXCERPTS
CITES RESULTS
HIGHLY INFLUENCED

Combinatorics of Ribbon Tableaux by Thomas Lam

VIEW 8 EXCERPTS
CITES RESULTS
HIGHLY INFLUENCED

Enumeration of Walks on Generalized Dierential Posets

VIEW 6 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Dual filtered graphs

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Signed enumeration of ribbon tableaux

VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1995
2019

CITATION STATISTICS

  • 23 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

  • 60% Increase in citations per year in 2018 over 2017

Similar Papers

Loading similar papers…