{"id":"https://openalex.org/W1653539840","doi":"https://doi.org/10.37236/1189","title":"The independence number of graphs with large odd girth","display_name":"The independence number of graphs with large odd girth","publication_year":1994,"publication_date":"1994-09-17","ids":{"openalex":"https://openalex.org/W1653539840","doi":"https://doi.org/10.37236/1189","mag":"1653539840"},"language":"en","primary_location":{"id":"doi:10.37236/1189","is_oa":false,"landing_page_url":"https://doi.org/10.37236/1189","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5028936741","display_name":"Tristan Denley","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Tristan Denley","raw_affiliation_strings":["Umea University"],"affiliations":[{"raw_affiliation_string":"Umea University","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028936741"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":null,"apc_paid":null,"fwci":0.495,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.54577328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11476","display_name":"Graph theory and applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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.9921000003814697,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9853000044822693,"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.8614716529846191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8511813879013062},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.8463025093078613},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.8186532855033875},{"id":"https://openalex.org/keywords/odd-graph","display_name":"Odd graph","score":0.6415543556213379},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5432658195495605},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5078805088996887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4861135482788086},{"id":"https://openalex.org/keywords/triangle-free-graph","display_name":"Triangle-free graph","score":0.4859134256839752},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.45441779494285583},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2511376142501831},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.08223122358322144},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07226738333702087}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8614716529846191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8511813879013062},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.8463025093078613},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.8186532855033875},{"id":"https://openalex.org/C206815938","wikidata":"https://www.wikidata.org/wiki/Q7077445","display_name":"Odd graph","level":5,"score":0.6415543556213379},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5432658195495605},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5078805088996887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4861135482788086},{"id":"https://openalex.org/C114727528","wikidata":"https://www.wikidata.org/wiki/Q7840044","display_name":"Triangle-free graph","level":5,"score":0.4859134256839752},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.45441779494285583},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2511376142501831},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08223122358322144},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07226738333702087},{"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.37236/1189","is_oa":false,"landing_page_url":"https://doi.org/10.37236/1189","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.2078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.2078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://palibaci.math.clemson.edu/Volume_1/../Volume_1/PDFFiles/v1i1r9.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.3889","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.helsinki.fi/EMIS/journals/EJC/Volume_1/../Volume_1/PostScriptfiles/v1i1r9.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1964543450","https://openalex.org/W2041605864","https://openalex.org/W2062230178","https://openalex.org/W2063175311","https://openalex.org/W2074920973","https://openalex.org/W2987732947"],"related_works":["https://openalex.org/W1653539840","https://openalex.org/W2147779969","https://openalex.org/W2333561420","https://openalex.org/W2094898130","https://openalex.org/W1484027990","https://openalex.org/W2009550992","https://openalex.org/W4240126258","https://openalex.org/W1985591473","https://openalex.org/W2528300898","https://openalex.org/W2043158961"],"abstract_inverted_index":{"Let":[0],"$G$":[1,17],"be":[2],"an":[3],"$r$-regular":[4],"graph":[5,55],"of":[6,45,53,56],"order":[7,57],"$n$":[8,58],"and":[9,47,59],"independence":[10,51],"number":[11,52],"$\\alpha(G)$.":[12],"We":[13,25],"show":[14],"that":[15],"if":[16],"has":[18],"odd":[19,60],"girth":[20,61],"$2k+3$":[21],"then":[22],"$\\alpha(G)\\geq":[23],"n^{1-1/k}r^{1/k}$.":[24],"also":[26],"prove":[27],"similar":[28],"results":[29,38],"for":[30,49],"graphs":[31],"which":[32],"are":[33],"not":[34],"regular.":[35],"Using":[36],"these":[37],"we":[39],"improve":[40],"on":[41],"the":[42,50],"lower":[43],"bound":[44],"Monien":[46],"Speckenmeyer,":[48],"a":[54],"$2k+3$.":[62]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}