15254 search results - page 318 / 3051 » A k |
151
click to vote
DM
2010
15 years 6 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
142
click to vote
EJC
2010
15 years 6 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
136
click to vote
EJC
2010
15 years 6 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
167
Voted
DM
2008
15 years 6 months ago
2008
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S
139
click to vote
AML
2006
15 years 6 months ago
2006
We prove that every homogeneously Souslin set is coanalytic provided that either (a) 0long does not exist, or else (b) V = K, where K is the core model below a