@article{journals/jct/AlonBKS03,
  added-at = {2024-06-07T00:00:00.000+0200},
  author = {Alon, Noga and Bollobás, Béla and Krivelevich, Michael and Sudakov, Benny},
  biburl = {https://www.bibsonomy.org/bibtex/25b1eed2cb6bb6314a0d608216b8fd684/dblp},
  ee = {https://doi.org/10.1016/S0095-8956(03)00036-4},
  interhash = {1b8f6350017974c5069b340a07d90790},
  intrahash = {5b1eed2cb6bb6314a0d608216b8fd684},
  journal = {J. Comb. Theory B},
  keywords = {dblp},
  number = 2,
  pages = {329-346},
  timestamp = {2024-06-10T07:13:26.000+0200},
  title = {Maximum cuts and judicious partitions in graphs without short cycles.},
  url = {http://dblp.uni-trier.de/db/journals/jct/jctb88.html#AlonBKS03},
  volume = 88,
  year = 2003
}

{"_id":"8aR5A4PhqSRwDDD63","bibbaseid":"alon-bollobs-krivelevich-sudakov-maximumcutsandjudiciouspartitionsingraphswithoutshortcycles-2003","author_short":["Alon, N.","Bollobás, B.","Krivelevich, M.","Sudakov, B."],"bibdata":{"bibtype":"article","type":"article","added-at":"2024-06-07T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Alon"],"firstnames":["Noga"],"suffixes":[]},{"propositions":[],"lastnames":["Bollobás"],"firstnames":["Béla"],"suffixes":[]},{"propositions":[],"lastnames":["Krivelevich"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Sudakov"],"firstnames":["Benny"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/25b1eed2cb6bb6314a0d608216b8fd684/dblp","ee":"https://doi.org/10.1016/S0095-8956(03)00036-4","interhash":"1b8f6350017974c5069b340a07d90790","intrahash":"5b1eed2cb6bb6314a0d608216b8fd684","journal":"J. Comb. Theory B","keywords":"dblp","number":"2","pages":"329-346","timestamp":"2024-06-10T07:13:26.000+0200","title":"Maximum cuts and judicious partitions in graphs without short cycles.","url":"http://dblp.uni-trier.de/db/journals/jct/jctb88.html#AlonBKS03","volume":"88","year":"2003","bibtex":"@article{journals/jct/AlonBKS03,\n added-at = {2024-06-07T00:00:00.000+0200},\n author = {Alon, Noga and Bollobás, Béla and Krivelevich, Michael and Sudakov, Benny},\n biburl = {https://www.bibsonomy.org/bibtex/25b1eed2cb6bb6314a0d608216b8fd684/dblp},\n ee = {https://doi.org/10.1016/S0095-8956(03)00036-4},\n interhash = {1b8f6350017974c5069b340a07d90790},\n intrahash = {5b1eed2cb6bb6314a0d608216b8fd684},\n journal = {J. Comb. Theory B},\n keywords = {dblp},\n number = 2,\n pages = {329-346},\n timestamp = {2024-06-10T07:13:26.000+0200},\n title = {Maximum cuts and judicious partitions in graphs without short cycles.},\n url = {http://dblp.uni-trier.de/db/journals/jct/jctb88.html#AlonBKS03},\n volume = 88,\n year = 2003\n}\n\n","author_short":["Alon, N.","Bollobás, B.","Krivelevich, M.","Sudakov, B."],"key":"journals/jct/AlonBKS03","id":"journals/jct/AlonBKS03","bibbaseid":"alon-bollobs-krivelevich-sudakov-maximumcutsandjudiciouspartitionsingraphswithoutshortcycles-2003","role":"author","urls":{"Link":"https://doi.org/10.1016/S0095-8956(03)00036-4","Paper":"http://dblp.uni-trier.de/db/journals/jct/jctb88.html#AlonBKS03"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Michael ?items=1000","dataSources":["PdoHvPQ8eNF9vBHTR"],"keywords":["dblp"],"search_terms":["maximum","cuts","judicious","partitions","graphs","without","short","cycles","alon","bollobás","krivelevich","sudakov"],"title":"Maximum cuts and judicious partitions in graphs without short cycles.","year":2003}