Sciweavers

1163 search results - page 36 / 233
» Embedding into Bipartite Graphs
Sort
View
JGT
2008
92views more  JGT 2008»
13 years 8 months ago
A new upper bound for the bipartite Ramsey problem
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
David Conlon
DM
2010
103views more  DM 2010»
13 years 8 months ago
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
Anthony J. W. Hilton
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas