Graphs, flags and partitions
| dc.creator | Fine, Jonathan | |
| dc.date | 1998-09-17 | |
| dc.date.accessioned | 2026-07-07T05:26:03Z | |
| dc.date.available | 2026-07-07T05:26:03Z | |
| dc.description | This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear inequalities satisfied by $fG$ may be both interesting and accessible. Such would provide inequalities both sharp and subtle on the combinatorial structure of $G$. These may be related to Ramsey theory. | |
| dc.description | 12 pages, LaTeX 2e, no figures | |
| dc.identifier | https://arxiv.org/abs/math/9809092 | |
| dc.identifier | http://arxiv.org/abs/math/9809092 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77409 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C;52B05 | |
| dc.title | Graphs, flags and partitions | |
| dc.type | text |