547 search results - page 84 / 110 » dm 2008 |
90
Voted
DM
2007
15 years 22 days ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
104
Voted
DM
2007
15 years 22 days ago
2007
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
98
Voted
DM
2007
15 years 22 days ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
101
Voted
DM
2000
15 years 17 days ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
85
Voted
DM
2002
15 years 17 days ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...