{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T23:03:06Z","timestamp":1773442986948,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1007\/bf01261315","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T22:01:48Z","timestamp":1111615308000},"page":"301-311","source":"Crossref","is-referenced-by-count":79,"title":["Bipartite subgraphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"N. Alon: Explicit Ramsey graphs and orthonormal labelings,The Electronic J. Combinatorics, 1 (1994), 8pp.","DOI":"10.37236\/1192"},{"key":"CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon, andJ. H. Spencer:The Probabilistic Method, John Wiley and Sons Inc., New York, 1992."},{"key":"CR3","first-page":"259","volume":"16","author":"L. D. Andersen","year":"1983","unstructured":"L. D. Andersen, D. D. Grant, andN. Linial: Extremalk-colorable subgraphs,Ars Combinatoria,16 (1983), 259?270.","journal-title":"Ars Combinatoria"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"3","author":"C. S. Edwards","year":"1973","unstructured":"C. S. Edwards: Some extremal properties of bipartite subgraphs,Canadian Journal of Mathematics,3 (1973), 475?485.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR5","unstructured":"C. S. Edwards: An improved lower bound for the number of edges in a largest bipartite subgraph,Proc. 2 nd Czechoslovak Symposium on Graph Theory, Prague, (1975), 167?181."},{"key":"CR6","first-page":"153","volume-title":"Graph Theory and Related Topics","author":"P. Erd?s","year":"1979","unstructured":"P. Erd?s: Problems and results in Graph Theory and Combinatorial Analysis, in:Graph Theory and Related Topics, J. A. Bondy and U. S. R. Murty (Eds.), Proc. Conf. Waterloo, 1977, Academic Press, New York, 1979, 153?163."},{"key":"CR7","unstructured":"P. Erd?s: Some recent problems in Combinatorics and Graph Theory,Proc. 26 th Southeastern International Conference on Graph Theory, Combinatorics and Computing, Boca Raton, 1995, Congressus Numerantium, to appear."},{"key":"CR8","unstructured":"P. Erd?s, A. Gy\ufffdrf\ufffds, andY. Kohyakawa: The size of the largest bipartite subgraphs, preprint, 1995."},{"key":"CR9","unstructured":"T. Hofmeister, andH. Lefmann: Onk-partite subgraphs, preprint, 1995."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(82)90040-1","volume":"30","author":"J. Lehel","year":"1982","unstructured":"J. Lehel, andZs. Tuza: Triangle-free partial graphs and edge-covering theorems,Discrete Math.,30 (1982), 59?63.","journal-title":"Discrete Math."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.3190060206","volume":"6","author":"S. C. Locke","year":"1982","unstructured":"S. C. Locke: Maximumk-colorable subgraphs,J. Graph Theory,6 (1982), 123?132.","journal-title":"J. Graph Theory"},{"key":"CR12","unstructured":"A. Lubotzky, R. Phillips, andP. Sarnak: Explicit expanders, and the Ramanujan conjectures,Proc. 18 th ACM STOC, (1986), 240?246. See also:A. Lubotzky, R. Phillips, andP. Sarnak: Ramanujan graphs,Combinatorica,8 (1988), 261?277."},{"key":"CR13","first-page":"51","volume":"24","author":"G. A. Margulis","year":"1988","unstructured":"G. A. Margulis: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentratorsProblemy Peredachi Informatsii,24 (1988), 51?60 (in Russian). English translation inProblems of Information Transmission,24 (1988), 39?46.","journal-title":"Problemy Peredachi Informatsii"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/S0895480191196824","volume":"7","author":"S. Poljak","year":"1994","unstructured":"S. Poljak, andZs. Tuza: Bipartite subgraphs of triangle-free graphs,SIAM J. Discrete Math.,7 (1994), 307?313.","journal-title":"SIAM J. Discrete Math."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan: Probabilistic construction of deterministic algorithms: approximating packing integer programs,Journal of Computer and System Sciences,37 (1988), 130?143.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/rsa.3240030211","volume":"3","author":"J. B. Shearer","year":"1992","unstructured":"J. B. Shearer: A note on bipartite subgraphs of triangle-free graphs,Random Structures and Algorithms 3 (1992), 223?226.","journal-title":"Random Structures and Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01261315\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T12:37:47Z","timestamp":1586176667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01261315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01261315"],"URL":"https:\/\/doi.org\/10.1007\/bf01261315","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}