Cyclic sieving for two families of non-crossing graphs (Q2963056)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cyclic sieving for two families of non-crossing graphs |
scientific article; zbMATH DE number 6683626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cyclic sieving for two families of non-crossing graphs |
scientific article; zbMATH DE number 6683626 |
Statements
10 February 2017
0 references
cyclic sieving
0 references
non-crossing forests
0 references
non-crossing graphs
0 references
0.8972917795181274
0 references
0.8316270112991333
0 references
0.7673217058181763
0 references
0.7550461292266846
0 references
