Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
ECCC
2010
2010
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
Real-time Traffic| Added | 17 May 2011 |
| Updated | 17 May 2011 |
| Type | Journal |
| Year | 2010 |
| Where | ECCC |
| Authors | Hao Huang, Benny Sudakov |
Comments (0)
Researcher Info
|
