1215 search results - page 95 / 243 » Combinatorics |
138
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
123
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...
130
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
124
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
134
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...