{"id":"https://openalex.org/W2159873465","doi":"https://doi.org/10.1017/s0963548300000389","title":"Large Induced Subgraphs with All Degrees Odd","display_name":"Large Induced Subgraphs with All Degrees Odd","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W2159873465","doi":"https://doi.org/10.1017/s0963548300000389","mag":"2159873465"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548300000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A9F3F37975E0A3C81790B337C2EBD3F5/S0963548300000389a.pdf/div-class-title-large-induced-subgraphs-with-all-degrees-odd-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A9F3F37975E0A3C81790B337C2EBD3F5/S0963548300000389a.pdf/div-class-title-large-induced-subgraphs-with-all-degrees-odd-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045091550","display_name":"Alex Scott","orcid":"https://orcid.org/0000-0003-4489-5988"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]},{"id":"https://openalex.org/I4210153325","display_name":"Institute of Mathematical Statistics","ror":"https://ror.org/043f04882","country_code":"US","type":"other","lineage":["https://openalex.org/I4210153325"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"A. D. Scott","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England","institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045091550"],"corresponding_institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"],"apc_list":null,"apc_paid":null,"fwci":1.5988,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.84031159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":"4","first_page":"335","last_page":"349"},"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.9926000237464905,"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.9926000237464905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7786068916320801},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6838359236717224},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6684530377388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6298197507858276},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5829529762268066},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5686405897140503},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5433680415153503},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5042451620101929},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4778684973716736},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.380387544631958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21210068464279175},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06375545263290405}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7786068916320801},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6838359236717224},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6684530377388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6298197507858276},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5829529762268066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5686405897140503},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5433680415153503},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5042451620101929},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4778684973716736},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.380387544631958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21210068464279175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06375545263290405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":4,"locations":[{"id":"doi:10.1017/s0963548300000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548300000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A9F3F37975E0A3C81790B337C2EBD3F5/S0963548300000389a.pdf/div-class-title-large-induced-subgraphs-with-all-degrees-odd-div.pdf","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:CiteSeerX.psu:10.1.1.176.1493","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.176.1493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.maths.ox.ac.uk/%7Escott/Papers/odds.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.7093","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.maths.ox.ac.uk/scott/Papers/odds2.pdf","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:64858112-8c33-41ca-8ee1-6bdcd4be8a66","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:64858112-8c33-41ca-8ee1-6bdcd4be8a66","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1017/s0963548300000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548300000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A9F3F37975E0A3C81790B337C2EBD3F5/S0963548300000389a.pdf/div-class-title-large-induced-subgraphs-with-all-degrees-odd-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2159873465.pdf","grobid_xml":"https://content.openalex.org/works/W2159873465.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W1515701089","https://openalex.org/W1569752386","https://openalex.org/W4298414065"],"related_works":["https://openalex.org/W2181667894","https://openalex.org/W2105223880","https://openalex.org/W2379048343","https://openalex.org/W4256403421","https://openalex.org/W2062039730","https://openalex.org/W2152117225","https://openalex.org/W2158905189","https://openalex.org/W4319874546","https://openalex.org/W4297807915","https://openalex.org/W3102805201"],"abstract_inverted_index":{"We":[0,32],"prove":[1],"that":[2],"every":[3],"connected":[4],"graph":[5],"of":[6,19,39],"order":[7,20],"n":[8,25],"\u2265":[9],"2":[10],"has":[11],"an":[12],"induced":[13],"subgraph":[14],"with":[15],"all":[16],"degrees":[17],"odd":[18],"at":[21],"least":[22],"cn":[23],"/log":[24],",":[26],"where":[27],"c":[28],"is":[29],"a":[30,35],"constant.":[31],"also":[33],"give":[34],"bound":[36],"in":[37],"terms":[38],"chromatic":[40],"number,":[41],"and":[42],"resolve":[43],"the":[44],"analogous":[45],"problem":[46],"for":[47],"random":[48],"graphs.":[49]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}