On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs (Q870048): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 02:27, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs |
scientific article |
Statements
On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs (English)
0 references
12 March 2007
0 references
Summary: This note contains two results on the distribution of \(k\)-crossings and \(k\)-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many \(k\)-noncrossing 2-nonnesting graphs as \(k\)-nonnesting 2-noncrossing graphs. This class consists of the graphs on \([n]\) where each vertex \(x\) is joined to at most one vertex \(y\) with \(y<x\). On the negative side, we show that this is not the case if we consider arbitrary graphs. The counterexample is given in terms of fillings of Ferrers diagrams and solves a problem of Krattenthaler.
0 references