EJC 2007 | Sciweavers

10

EJC
2006

119views Information Technology» more EJC 2006»

13 years 4 months ago

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

claim paper

Read More »

10

click to vote

EJC
2006

91views Information Technology» more EJC 2006»

Counting connected graphs asymptotically

13 years 4 months ago

Download www.win.tue.nl

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

claim paper

Read More »

12

click to vote

EJC
2006

93views Information Technology» more EJC 2006»

Hamilton cycles in random lifts of graphs

13 years 4 months ago

Download www.math.cmu.edu

An n-lift of a graph K, is a graph with vertex set V (K)

K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...

claim paper

Read More »

8

click to vote

EJC
2006

82views Information Technology» more EJC 2006»

On the diameter of separated point sets with many nearly equal distances

13 years 4 months ago

Download www.math.princeton.edu

János Pach, Rados Radoicic, Jan Vondr&aacut...

claim paper

Read More »

9

click to vote

EJC
2006

99views Information Technology» more EJC 2006»

Eulerian colorings and the bipartizing matchings conjecture of Fleischner

13 years 4 months ago

Download home.zcu.cz

Zdenek Dvorak, Tomás Kaiser, Daniel Kr&aacu...

claim paper

Read More »

9

click to vote

EJC
2006

84views Information Technology» more EJC 2006»

A note on the Hopf-Stiefel function

13 years 4 months ago

Download www.cs.elte.hu

Gyula Károlyi

claim paper

Read More »

13

click to vote

EJC
2006

89views Information Technology» more EJC 2006»

Tracing a single user

13 years 4 months ago

Download www.math.tau.ac.il

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

claim paper

Read More »

13

click to vote

EJC
2006

126views Information Technology» more EJC 2006»

3-star factors in random d-regular graphs

13 years 4 months ago

Download www.math.uwaterloo.ca

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

claim paper

Read More »

9

click to vote

EJC
2006

66views Information Technology» more EJC 2006»

Toward the classification of Moufang loops of order 64

13 years 4 months ago

Download www.du.edu

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ý

claim paper

Read More »

8

click to vote

EJC
2006

78views Information Technology» more EJC 2006»

Pairwise intersections and forbidden configurations

13 years 4 months ago