{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:29:03Z","timestamp":1768292943661,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00493-012-2746-4","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:48:05Z","timestamp":1338922085000},"page":"205-219","source":"Crossref","is-referenced-by-count":18,"title":["A counterexample to the Alon-Saks-Seymour conjecture and related problems"],"prefix":"10.1007","volume":"32","author":[{"given":"Hao","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"2746_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-642-60406-5_3","volume":"14","author":"N. Alon","year":"1997","unstructured":"N. Alon: Neighborly families of boxes and bipartite coverings, Algorithms and Combinatorics 14 (1997), 27\u201331.","journal-title":"Algorithms and Combinatorics"},{"key":"2746_CR2","unstructured":"N. Alon and I. Haviv: private communication."},{"key":"2746_CR3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/jgt.3190130413","volume":"13","author":"N. Alon","year":"1989","unstructured":"N. Alon and P. Seymour: A counterexample to the rank-coloring conjecture, Journal of Graph Theory 13 (1989), 523\u2013525.","journal-title":"Journal of Graph Theory"},{"key":"2746_CR4","unstructured":"L. Babai and P. Frankl: Linear algebra methods in combinatorics with applications to geometry and computer science, The University of Chicago, 1992."},{"key":"2746_CR5","first-page":"189","volume":"60","author":"S. Fajtlowicz","year":"1987","unstructured":"S. Fajtlowicz: On conjectures of Graffiti II, Congressus Numeratum 60 (1987), 189\u2013198.","journal-title":"Congressus Numeratum"},{"key":"2746_CR6","unstructured":"Z. Gao, McKay B.D., R. Naserasr and B. Stevens: On Alon-Saks-Seymour conjecture, to appear."},{"key":"2746_CR7","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0067362","volume-title":"Graph theory and applications","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham and H. O. Pollak: On embedding graphs in squashed cubes, in: Graph theory and applications, Lecture Notes in Math. 303, Springer, Berlin, 1972, 99\u2013110."},{"key":"2746_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-3165(92)90096-D","volume":"59","author":"J. Kahn","year":"1992","unstructured":"J. Kahn: Coloring nearly-disjoint hypergraphs with n+o(n) colors, J. Combin. Theory Ser. A 59 (1992), 31\u201339.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2746_CR9","series-title":"Bolyai Soc. Math. Stud.","first-page":"305","volume-title":"Extremal problems for finite sets (Visegr\u00e1ad, 1991)","author":"J. Kahn","year":"1994","unstructured":"J. Kahn: Recent results on some not-so-recent hypergraph matching and covering problems, in: Extremal problems for finite sets (Visegr\u00e1ad, 1991), Bolyai Soc. Math. Stud. vol. 3, J\u00e1anos Bolyai Math. Soc., Budapest, 1994, 305\u2013353."},{"key":"2746_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s004930050054","volume":"19","author":"E. Kushilevitz","year":"1999","unstructured":"E. Kushilevitz, N. Linial and R. Ostrovsky: The linear-array conjecture in communication complexity is false, Combinatorica 19 (1999), 241\u2013254.","journal-title":"Combinatorica"},{"key":"2746_CR11","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz and N. Nisan: Communication complexity, Cambridge University Press, Cambridge, 1997."},{"key":"2746_CR12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0022-0000(93)90035-U","volume":"47","author":"L. Lov\u00e1asz","year":"1993","unstructured":"L. Lov\u00e1asz and M. Saks: Lattices, Mobius functions, and communication complexity, Journal of Computer and System Sciences 47 (1993), 322\u2013349.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"2746_CR13","doi-asserted-by":"crossref","first-page":"N34","DOI":"10.37236\/272","volume":"16","author":"D. Mubayi","year":"2009","unstructured":"D. Mubayi and S. Vishwanathan: Biclique Coverings and the Chromatic Number, The Electronic Journal of Combinatorics 16(1) (2009), N34.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"2746_CR14","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"N. Nisan and A. Wigderson: On rank vs. communication complexity, Combinatorica 15 (1995), 557\u2013565.","journal-title":"Combinatorica"},{"key":"2746_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(84)90174-2","volume":"49","author":"G. Peck","year":"1984","unstructured":"G. Peck: A new proof of a theorem of Graham and Pollak, Discrete Math. 49 (1984), 327\u2013328.","journal-title":"Discrete Math"},{"key":"2746_CR16","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/BF01192528","volume":"15","author":"R. Raz","year":"1995","unstructured":"R. Raz and B. Spieker: On the \u201clog rank\u201d-conjecture in communication complexity, Combinatorica 15 (1995), 567\u2013588.","journal-title":"Combinatorica"},{"key":"2746_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(92)90691-8","volume":"108","author":"A. Razborov","year":"1992","unstructured":"A. Razborov: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear, Discrete Math. 108 (1992), 393\u2013396.","journal-title":"Discrete Math"},{"key":"2746_CR18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","volume":"6","author":"H. Tverberg","year":"1982","unstructured":"H. Tverberg: On the decomposition of Kn into complete bipartite graphs, J. Graph Theory 6 (1982), 493\u2013494.","journal-title":"J. Graph Theory"},{"key":"2746_CR19","doi-asserted-by":"crossref","unstructured":"C. Van Nuffelen: Rank, Clique, and Chromatic Number of a Graph, System Modeling and Optimization, 38, Lect. Notes Control Inf. Sci, 605\u2013611.","DOI":"10.1007\/BFb0006185"},{"key":"2746_CR20","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.jcta.2007.07.006","volume":"115","author":"S. Vishwanathan","year":"2008","unstructured":"S. Vishwanathan: A polynomial space proof of the Graham-Pollak theorem, J. Combin. Theory Ser. A 115 (2008), 674\u2013676.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2746_CR21","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M. Yannakakis","year":"1991","unstructured":"M. Yannakakis: Expressing combinatorial optimization problems by linear programs, Journal of Computer and System Sciences 43 (1991), 441\u2013466.","journal-title":"Journal of Computer and System Sciences"},{"key":"2746_CR22","doi-asserted-by":"crossref","unstructured":"A. Yao: Some complexity questions related to distributive computing, Proceedings of the 11th ACM STOC, ACM New York (1979), 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"2746_CR23","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00151512","volume":"8","author":"J. Zaks","year":"1979","unstructured":"J. Zaks: Bounds of neighborly families of convex polytopes, Geometriae Dedicata 8 (1979), 279\u2013296.","journal-title":"Geometriae Dedicata"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2746-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2746-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2746-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T11:19:38Z","timestamp":1594207178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2746-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["2746"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2746-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}