| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652809 | Electronic Notes in Discrete Mathematics | 2007 | 8 Pages |
Abstract
We study the distribution of k-crossings and k-nestings and other patterns in ordered graphs by using fillings of Ferrers diagrams. The main result states that there are as many graphs without k-crossings as without k-nestings. We also show that studying equirrestrictive patterns in ordered graphs is equivalent to studying equirrestrictive matrices in fillings of Ferrers diagrams.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
