275 search results - page 2 / 55 » Bounding the Number of Edges in Permutation Graphs |
JGT
2007
13 years 4 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
JCT
2007
13 years 4 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
COMBINATORICS
1998
13 years 4 months ago
1998
JCT
2008
13 years 4 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...