{"id":"https://openalex.org/W2106107541","doi":"https://doi.org/10.1017/s0963548312000417","title":"Embedding Spanning Bipartite Graphs of Small Bandwidth","display_name":"Embedding Spanning Bipartite Graphs of Small Bandwidth","publication_year":2012,"publication_date":"2012-10-03","ids":{"openalex":"https://openalex.org/W2106107541","doi":"https://doi.org/10.1017/s0963548312000417","mag":"2106107541"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000417","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000417","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063051891","display_name":"Fiachra Knox","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"FIACHRA KNOX","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Birmingham B15 2TT, UK (e-mail:","School of mathematics, university of birmingham, birmingham b15 2tt, uk e-mail: knoxf@maths.bham.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Birmingham B15 2TT, UK (e-mail:","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of mathematics, university of birmingham, birmingham b15 2tt, uk e-mail: knoxf@maths.bham.ac.uk#TAB#","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086607043","display_name":"Andrew Treglown","orcid":"https://orcid.org/0000-0002-4293-5678"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"ANDREW TREGLOWN","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 N\u00e1m\u011bst\u00ed 25, 188 00 Prague, Czech Republic (e-mail:","Faculty of mathematics and physics, charles university, malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 188 00 prague, czech republic e-mail: treglown@kam.mff.cuni.cz#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 N\u00e1m\u011bst\u00ed 25, 188 00 Prague, Czech Republic (e-mail:","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of mathematics and physics, charles university, malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 188 00 prague, czech republic e-mail: treglown@kam.mff.cuni.cz#TAB#","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":2.6775,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90180965,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"1","first_page":"71","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8886555433273315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7956990003585815},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7582930326461792},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5397323966026306},{"id":"https://openalex.org/keywords/frequency-partition-of-a-graph","display_name":"Frequency partition of a graph","score":0.5188604593276978},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5164985060691833},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5099111795425415},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4500185251235962},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.41958943009376526},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4182617664337158},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3747641146183014},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33462363481521606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08134812116622925}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8886555433273315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7956990003585815},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7582930326461792},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5397323966026306},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.5188604593276978},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5164985060691833},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5099111795425415},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4500185251235962},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.41958943009376526},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4182617664337158},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3747641146183014},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33462363481521606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08134812116622925},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548312000417","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000417","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1503cb4a-f2a7-4b73-9218-67c13d998ef7","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/1503cb4a-f2a7-4b73-9218-67c13d998ef7","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Knox, F & Treglown, A 2013, 'Embedding Spanning Bipartite Graphs of Small Bandwidth', Combinatorics, Probability and Computing, vol. 22, no. 01, pp. 71-96. https://doi.org/10.1017/S0963548312000417","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/1503cb4a-f2a7-4b73-9218-67c13d998ef7","is_oa":false,"landing_page_url":"http://www.journals.cambridge.org/abstract_S0963548312000417","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Knox, F & Treglown, A 2013, 'Embedding Spanning Bipartite Graphs of Small Bandwidth', Combinatorics, Probability and Computing, vol. 22, no. 01, pp. 71-96. https://doi.org/10.1017/S0963548312000417","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W658849301","https://openalex.org/W1963641871","https://openalex.org/W1971367602","https://openalex.org/W1973167211","https://openalex.org/W1988204800","https://openalex.org/W1991387851","https://openalex.org/W1991646384","https://openalex.org/W1995457760","https://openalex.org/W2000934872","https://openalex.org/W2005223884","https://openalex.org/W2009873575","https://openalex.org/W2014564484","https://openalex.org/W2015263376","https://openalex.org/W2017776863","https://openalex.org/W2018724658","https://openalex.org/W2030651378","https://openalex.org/W2035089435","https://openalex.org/W2054249991","https://openalex.org/W2056485055","https://openalex.org/W2083035128","https://openalex.org/W2094126876","https://openalex.org/W2101846098","https://openalex.org/W2116537669","https://openalex.org/W2131867452","https://openalex.org/W2161551214","https://openalex.org/W2166751465","https://openalex.org/W2172107634","https://openalex.org/W2950795664","https://openalex.org/W4252663710"],"related_works":["https://openalex.org/W2391237956","https://openalex.org/W2384730381","https://openalex.org/W4298172984","https://openalex.org/W3193236920","https://openalex.org/W4213419526","https://openalex.org/W1858680408","https://openalex.org/W3215173006","https://openalex.org/W1985260677","https://openalex.org/W3037602378","https://openalex.org/W2040301912"],"abstract_inverted_index":{"B\u00f6ttcher,":[0],"Schacht":[1],"and":[2,38,51,103,150],"Taraz":[3],"(":[4,42,53,107],"Math.":[5],"Ann.":[6],",":[7,57],"2009)":[8],"gave":[9],"a":[10,17,47,82,120,132,145,157,161],"condition":[11,76,126],"on":[12,20,32,77,85,97,127],"the":[13,64,78,125,141,153],"minimum":[14],"degree":[15,37,79,102,154],"of":[16,35,39,49,81,100,104,144,147,156],"graph":[18,30,83,95,158],"G":[19,25,84,90,128],"n":[21,33,43,86,98,108],"vertices":[22,34,87,99],"that":[23,88],"ensures":[24],"contains":[26],"every":[27,93],"r":[28],"-chromatic":[29],"H":[31,67,96,163],"bounded":[36,101],"bandwidth":[40,105],"o":[41,106],"),":[44],"thereby":[45],"proving":[46],"conjecture":[48,146],"Bollob\u00e1s":[50],"Koml\u00f3s":[52],"Combin.":[54],"Probab.":[55],"Comput.":[56],"1999).":[58],"We":[59],"strengthen":[60],"this":[61],"result":[62,123,138],"in":[63],"case":[65,143],"when":[66],"is":[68,129],"bipartite.":[69],"Indeed,":[70],"we":[71,118],"give":[72],"an":[73,113],"essentially":[74],"best-possible":[75],"sequence":[80,155],"forces":[89,160],"to":[91,131],"contain":[92],"bipartite":[94,142],").":[109],"This":[110],"also":[111,139],"implies":[112],"Ore-type":[114],"result.":[115],"In":[116],"fact,":[117],"prove":[119],"much":[121],"stronger":[122],"where":[124],"relaxed":[130],"certain":[133],"robust":[134],"expansion":[135],"property.":[136],"Our":[137],"confirms":[140],"Balogh,":[148],"Kostochka":[149],"Treglown":[151],"concerning":[152],"which":[159],"perfect":[162],"-packing.":[164]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}