| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646706 | Discrete Mathematics | 2016 | 7 Pages |
Abstract
We say that G is an ordered graph if there is a linear ordering on the set of its vertices. In this paper we count ordered graphs that avoid a fixed forbidden ordered subgraph. We forbid each ordered graph with 2 edges and no isolated vertices. After a few trivial cases we show a coding of linear subspaces of F2n using colored M-avoiding graphs. We also consider the connection between subspaces and their orthogonal complements. We show a bijection between non-crossing and non-nesting graphs of order n and some other objects.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
László Ozsvárt,