{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:38:58Z","timestamp":1787323138357,"version":"3.56.0"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>We prove that every bipartite graph of sufficiently large average degree has either a $K_{t,t}$-subgraph or an induced subgraph of average degree at least $t$ and girth at least 6. We conjecture that \u201c6\u201d can be replaced by any constant \u201c$k$,\u201d which strengthens a conjecture of Thomassen. In support of this conjecture, we show that it holds for regular graphs.<\/jats:p>","DOI":"10.1137\/20m1370744","type":"journal-article","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T14:13:46Z","timestamp":1617891226000},"page":"661-667","source":"Crossref","is-referenced-by-count":8,"title":["Dense Induced Subgraphs of Dense Bipartite Graphs"],"prefix":"10.1137","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9884-3406","authenticated-orcid":true,"given":"Rose","family":"McCarty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,4,8]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20534"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.04.002"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.10.004"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548319000026"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90081-X"},{"key":"atypb6","first-page":"196","author":"Gurski F.","year":"2000","journal-title":"Berlin"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-1-50-57"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0010-2"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0017-8"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-019-4086-0"},{"key":"atypb11","unstructured":"J. Ne\u0161et\u0159il, P. Ossona de Mendez, R. Rabinovich, and S. Siebertz,\n                      Classes of graphs with low complexity: the case of classes with bounded linear rankwidth\n                      , Preprint,https:\/\/arxiv.org\/abs\/1909.01564, 2019."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1004"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22601"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90067-9"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2019.04.004"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1370744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:43:42Z","timestamp":1787319822000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1370744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1370744"],"URL":"https:\/\/doi.org\/10.1137\/20m1370744","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}