{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:45:43Z","timestamp":1771328743627,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,11,4]],"date-time":"2006-11-04T00:00:00Z","timestamp":1162598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2006,11,29]]},"DOI":"10.1007\/s11083-006-9043-z","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T08:48:22Z","timestamp":1162543702000},"page":"197-209","source":"Crossref","is-referenced-by-count":28,"title":["A Bipartite Analogue of Dilworth\u2019s Theorem"],"prefix":"10.1007","volume":"23","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,4]]},"reference":[{"issue":"2","key":"9043_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues and expanders. Theory of computing (Singer Island, Fla., 1984). Combinatorica 6(2), 83\u201396 (1986)","journal-title":"Combinatorica"},{"issue":"6","key":"9043_CR2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/jgt.3190140605","volume":"14","author":"N. Alon","year":"1990","unstructured":"Alon, N.: Ramsey graphs cannot be defined by real polynomials. J. Graph Theory 14(6), 651\u2013661 (1990)","journal-title":"J. Graph Theory"},{"issue":"1","key":"9043_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"Alon, N., Milman, V.D.: $\\lambda\\sb 1,$ isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory Ser. B 38(1), 73\u201388 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9043_CR4","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.jcta.2004.12.008","volume":"111","author":"N. Alon","year":"2005","unstructured":"Alon, N., Pach, J., Pinchasi, R., Radoi\u010di\u0107, R., Sharir, M.: Crossing patterns of semi-algebraic sets. J. Comb. Theory Ser A 111, 310-326 (2005)","journal-title":"J. Comb. Theory Ser A"},{"key":"9043_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: new constructions of condensers, Ramsey graphs, dispersers and extractors. In: Proc. of the 37th ACM STOC, pp. 1\u201310 (2005)","DOI":"10.1145\/1060590.1060592"},{"key":"9043_CR6","first-page":"498","volume-title":"Algorithms \u2013 ESA \u201999 (Prague). Lecture Notes Computer Science, vol 1643","author":"A. Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A., Andr\u00e1s, A., F\u00f6rster, J., Kir\u00e1ly, Z.: Dilworth\u2019s theorem and its application for path systems of a cycle \u2014 implementation and analysis. Algorithms \u2013 ESA \u201999 (Prague). Lecture Notes Computer Science, vol. 1643, pp. 498\u2013509. Springer, Berlin Heidelberg New York (1999)"},{"key":"9043_CR7","first-page":"123","volume":"9","author":"C. Berge","year":"1960","unstructured":"Berge, C.: Les probl\u00e8mes de coloration en th\u00e9orie des graphes. Publ. Inst. Stat. Univ. Paris 9, 123\u2013160 (1960)","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"issue":"3","key":"9043_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01285816","volume":"12","author":"P. Chiu","year":"1992","unstructured":"Chiu, P.: Cubic Ramanujan graphs. Combinatorica 12(3), 275\u2013285 (1992)","journal-title":"Combinatorica"},{"key":"9043_CR9","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229.","DOI":"10.4007\/annals.2006.164.51"},{"issue":"2","key":"9043_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"9043_CR11","first-page":"64","volume":"10","author":"P. Erd\u0151s","year":"2000","unstructured":"Erd\u0151s, P., Hajnal, A., Pach, J.: Ramsey-type theorem for bipartite graphs. Geombinatorics 10, 64\u201368 (2000)","journal-title":"Geombinatorics"},{"key":"9043_CR12","first-page":"365","volume-title":"On a problem of Moser. Combinatorial theory and its applications, I. (Proc. Colloq., Balatonf\u00fcred, 1969)","author":"P. Erd\u0151s","year":"1970","unstructured":"Erd\u0151s, P., Koml\u00f3s, J.: On a problem of Moser. Combinatorial theory and its applications, I. (Proc. Colloq., Balatonf\u00fcred, 1969), pp. 365\u2013367. North-Holland, Amsterdam (1970)"},{"key":"9043_CR13","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"9043_CR14","unstructured":"Fox, J., Pach, J.: A bipartite analogue of Dilworth\u2019s theorem for multiple partial orders, preprint."},{"key":"9043_CR15","volume-title":"Classic Papers in Combinatorics","year":"1987","unstructured":"Gessel, I., Rota, G-C (ed.): Classic Papers in Combinatorics. Birkhauser Boston, MA (1987)"},{"key":"9043_CR16","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.: Ramsey Theory, 2nd edn. John Wiley, New York (1990)","edition":"2"},{"issue":"1","key":"9043_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Comb. Theory Ser. A. 20(1), 41\u201368 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"9043_CR18","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1112\/blms\/26.2.132","volume":"26","author":"D. Larman","year":"1994","unstructured":"Larman, D., Matou\u0161ek, J., Pach, J., T\u00f6r\u00f6csik, J.: A Ramsey-type result for convex sets. Bull. Lond. Math. Soc. 26(2), 132\u2013136 (1994)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"9043_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"2","key":"9043_CR20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0196-6774(92)90021-4","volume":"13","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Welzl, E.: Good splitters for counting points in triangles. J. Algorithms 13(2), 307\u2013319 (1992)","journal-title":"J. Algorithms"},{"issue":"1","key":"9043_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q. J. Comb. Theory Ser. B. 62(1), 44\u201362 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"9043_CR22","first-page":"1","volume":"18","author":"M.R. Murty","year":"2003","unstructured":"Murty, M.R.: Ramanujan graphs. J. Ramanujan Math. Soc. 18(1), 1\u201320 (2003)","journal-title":"J. Ramanujan Math. Soc."},{"key":"9043_CR23","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/jcta.2001.3184","volume":"96","author":"J. Pach","year":"2001","unstructured":"Pach, J., Solymosi, J.: Crossing patterns of segments. J. Comb. Theory Ser. A. 96, 316\u2013325 (2001)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"9043_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J. Pach","year":"1994","unstructured":"Pach, J., T\u00f6r\u0151csik, J.: Some geometric applications of Dilworth\u2019s theorem. Discrete Comput. Geom. 12(1), 1\u20137 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"9043_CR25","first-page":"150","volume":"15","author":"J. Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Comments on Fox News. Geombinatorics 15, 150\u2013154 (2006)","journal-title":"Geombinatorics"},{"key":"9043_CR26","first-page":"327","volume":"13","author":"P. Pudl\u00e1k","year":"2004","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V.: Pseudorandom sets and explicit constructions of Ramsey graphs. Complexity of computations and proofs. Quad. Mat. 13, 327\u2013346, Dept. Math., Seconda Univ. Napoli, Caserta, Italy (2004)","journal-title":"Quad. Mat."},{"key":"9043_CR27","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D. Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. J. Comb. Theory Ser. B. 16, 191\u2013193 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9043_CR28","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01693778","volume":"16","author":"H. Tietze","year":"1905","unstructured":"Tietze, H.: \u00dcber das Problem der Nachbargeibiete im Raum. Monatshefte Math. 16, 211\u2013216 (1905)","journal-title":"Monatshefte Math."},{"issue":"4","key":"9043_CR29","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/PL00009482","volume":"22","author":"G. T\u00f3th","year":"1999","unstructured":"T\u00f3th, G., Valtr, P.: Geometric graphs with few disjoint edges. 14th Annual ACM Symposium on Computational Geometry, Minneapolis, MN, 1998. Discrete Comput. Geom. 22(4), 633\u2013642 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9043_CR30","volume-title":"Combinatorics and Partially Ordered Sets. Dimension Theory. Johns Hopkins Series in the Mathematical Sciences","author":"W.T. Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets. Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD 1992"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-006-9043-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-006-9043-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-006-9043-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:12:11Z","timestamp":1559351531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-006-9043-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,4]]},"references-count":30,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,11,29]]}},"alternative-id":["9043"],"URL":"https:\/\/doi.org\/10.1007\/s11083-006-9043-z","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,4]]}}}