Sciweavers

EJC
2006
13 years 11 months ago
Antisymmetric flows in matroids
We present a seemingly new definition of flows and flow numbers for oriented matroids and prove that the flow number L and the antisymmetric flow number Las of an oriented matroid...
Winfried Hochstättler, Jaroslav Nesetril
EJC
2006
13 years 11 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
EJC
2006
13 years 11 months ago
Hamilton cycles in random lifts of graphs
An n-lift of a graph K, is a graph with vertex set V (K)
K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...
EJC
2006
13 years 11 months ago
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
Zdenek Dvorak, Tomás Kaiser, Daniel Kr&aacu...
EJC
2006
13 years 11 months ago
Tracing a single user
Let g(n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, . . . , n} so that given a union of at most r members of F, one can identify at least one of the...
Noga Alon, Vera Asodi
EJC
2006
13 years 11 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
EJC
2006
13 years 11 months ago
Toward the classification of Moufang loops of order 64
We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no oth...
Petr Vojtechovský