{"id":"https://openalex.org/W1479860649","doi":"https://doi.org/10.37236/1010","title":"Connectivity of the Lifts of a Greedoid","display_name":"Connectivity of the Lifts of a Greedoid","publication_year":2007,"publication_date":"2007-05-23","ids":{"openalex":"https://openalex.org/W1479860649","doi":"https://doi.org/10.37236/1010","mag":"1479860649"},"language":"en","primary_location":{"id":"doi:10.37236/1010","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1010","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n9/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n9/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007559502","display_name":"Steven J. Tedford","orcid":"https://orcid.org/0000-0002-8749-0801"},"institutions":[{"id":"https://openalex.org/I173146385","display_name":"Franklin & Marshall College","ror":"https://ror.org/04fp4ps48","country_code":"US","type":"education","lineage":["https://openalex.org/I173146385"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steven J. Tedford","raw_affiliation_strings":["Department of Mathematics and Computer Science Franklin and Marshall College PO Box 3003, Lancaster, PA 17604-3003"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science Franklin and Marshall College PO Box 3003, Lancaster, PA 17604-3003","institution_ids":["https://openalex.org/I173146385"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007559502"],"corresponding_institution_ids":["https://openalex.org/I173146385"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0469998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T12069","display_name":"Commutative Algebra and Its Applications","score":0.9670000076293945,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9666000008583069,"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/lift","display_name":"Lift (data mining)","score":0.8635599613189697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8231149911880493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8103759288787842},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6915966272354126},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5731931924819946},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5385028123855591},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4412563145160675},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.43157389760017395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09404751658439636},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.04535505175590515}],"concepts":[{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.8635599613189697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8231149911880493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8103759288787842},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6915966272354126},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5731931924819946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5385028123855591},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4412563145160675},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.43157389760017395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09404751658439636},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.04535505175590515},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1010","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1010","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n9/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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.178.5380","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.5380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_14/PDF/v14i1n9.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1010","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1010","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n9/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1479860649.pdf","grobid_xml":"https://content.openalex.org/works/W1479860649.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W230948644","https://openalex.org/W2039773332","https://openalex.org/W2149293266","https://openalex.org/W2327804023","https://openalex.org/W2913109207"],"related_works":["https://openalex.org/W2462424100","https://openalex.org/W2148974013","https://openalex.org/W2130873474","https://openalex.org/W2034871982","https://openalex.org/W1983409968","https://openalex.org/W2034850439","https://openalex.org/W4205772203","https://openalex.org/W2069614077","https://openalex.org/W2369229885","https://openalex.org/W2047609543"],"abstract_inverted_index":{"Recently,":[0],"attempts":[1],"were":[2],"made":[3],"to":[4,10,154,159],"generalize":[5],"the":[6,22,38,41,46,50,67,74,99,105,110,116,122,126,151],"undirected":[7,42,127],"branching":[8,43,128],"greedoid":[9,12,44,57,75,129],"a":[11,36,56,93],"whose":[13,60],"feasible":[14],"sets":[15,18,59],"consist":[16],"of":[17,19,40,55,92,101,112,125],"edges":[20],"containing":[21,104,115],"root":[23,106],"satisfying":[24],"additional":[25],"size":[26],"restrictions.":[27],"Although":[28],"this":[29],"definition":[30],"does":[31],"not":[32],"always":[33],"result":[34],"in":[35,66],"greedoid,":[37],"lift":[39,54,80,124,153],"has":[45,58],"properties":[47],"desired":[48],"by":[49],"authors.":[51],"The":[52],"$k$-th":[53,123],"nullity":[61],"is":[62,76,81,130],"at":[63],"most":[64],"$k$":[65],"original":[68],"greedoid.":[69],"We":[70,118,141],"prove":[71,119],"that":[72,120,146],"if":[73,121],"$n$-connected,":[77],"then":[78,132],"its":[79],"also":[82,142],"$n$-connected.":[83],"Additionally,":[84],"for":[85,150],"any":[86],"cut-vertex":[87],"$v$":[88],"and":[89,107,137],"cut-edge":[90],"$e$":[91],"graph":[94],"$\\Gamma$,":[95],"let":[96],"$C(v)$":[97],"be":[98,109,155],"component":[100,111],"$\\Gamma\\setminus":[102,113],"v$":[103],"$C(e)$":[108],"e$":[114],"root.":[117],"2-connected,":[131],"$$\\eqalign{":[133],"|{E(C(v))}|&amp;":[134],"&lt;":[135],"|{V(C(v))}|+k-1\\hbox{":[136],"}\\cr":[138],"|{E(C(e))}|&amp;&gt;|{E(\\Gamma)}|-{k}-2.\\cr":[139],"}$$":[140],"give":[143],"examples":[144],"indicating":[145],"no":[147],"sufficient":[148],"conditions":[149],"$k$th":[152],"2-connected":[156],"exists":[157],"similar":[158],"these":[160],"necessary":[161],"conditions.":[162]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
