6 search results - page 2 / 2 » Domination in Graphs of Minimum Degree at least Two and Larg... |
JCT
2008
13 years 5 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...