46 search results - page 3 / 10 » jct 2011 |
JCT
2011
13 years 12 days ago
2011
JCT
2011
13 years 12 days ago
2011
JCT
2011
13 years 12 days ago
2011
Let r, n be positive integers. Let e be 0 or an integer bigger than
JCT
2011
13 years 12 days ago
2011
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
JCT
2011
13 years 12 days ago
2011
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...