{"id":"https://openalex.org/W4399186202","doi":"https://doi.org/10.1145/3664277","title":"Lower Bound for Independence Covering in <i>C</i> <sub>4</sub> -free Graphs","display_name":"Lower Bound for Independence Covering in <i>C</i> <sub>4</sub> -free Graphs","publication_year":2024,"publication_date":"2024-05-30","ids":{"openalex":"https://openalex.org/W4399186202","doi":"https://doi.org/10.1145/3664277"},"language":"en","primary_location":{"id":"doi:10.1145/3664277","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3664277","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3664277","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3664277","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003406386","display_name":"Michael K\u00fchn","orcid":"https://orcid.org/0000-0002-9226-1480"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Kuhn","raw_affiliation_strings":["University of California Santa Barbara, Santa Barbara, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara, Santa Barbara, United States","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California Santa Barbara, Santa Barbara, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara, Santa Barbara, United States","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059104887","display_name":"Zachary Miller","orcid":"https://orcid.org/0000-0002-5991-3053"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zachary Miller","raw_affiliation_strings":["University of California Santa Barbara, Santa Barbara, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara, Santa Barbara, United States","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09248343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"3","first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994000196456909,"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/independence","display_name":"Independence (probability theory)","score":0.6130433678627014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.593595027923584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.591655969619751},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5159109830856323},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.5084627866744995},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4291877746582031},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4044644832611084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19547736644744873},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11483064293861389}],"concepts":[{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.6130433678627014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.593595027923584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.591655969619751},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5159109830856323},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.5084627866744995},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4291877746582031},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4044644832611084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19547736644744873},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11483064293861389},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3664277","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3664277","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3664277","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3664277","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3664277","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3664277","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399186202.pdf"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2566249719","https://openalex.org/W2611126464","https://openalex.org/W3006397453","https://openalex.org/W3008279586","https://openalex.org/W3033379983","https://openalex.org/W3119713976","https://openalex.org/W4235693166","https://openalex.org/W4367369709"],"related_works":["https://openalex.org/W4238032972","https://openalex.org/W3148147474","https://openalex.org/W2079112245","https://openalex.org/W2117848356","https://openalex.org/W2043410679","https://openalex.org/W1970195683","https://openalex.org/W2014290730","https://openalex.org/W1989846519","https://openalex.org/W2079330337","https://openalex.org/W4311654148"],"abstract_inverted_index":{"An":[0],"independent":[1,23,38],"set":[2,9,39],"in":[3,15,25,41],"a":[4,8,29,100,152,164,173,203],"graph":[5,155],"G":[6,16,26,42],"is":[7,27,128,202],"S":[10],"of":[11,22,43,74,82,102,115,118,138,145,177,185,195,228],"pairwise":[12],"non-adjacent":[13],"vertices":[14,159],".":[17,61,112,148,198,232],"A":[18],"family":[19,34],"\\(\\mathcal":[20],"{F}\\)":[21,55],"sets":[24],"called":[28,166],"k":[30,47,78,141,191,224],"-":[31,168],"independence":[32],"covering":[33,80,143,193,226],"if":[35],"for":[36,99],"every":[37],"I":[40],"size":[44,83,146,196,229],"at":[45],"most":[46],",":[48,69,171],"there":[49],"exists":[50],"an":[51],"\\(S":[52],"\\in":[53],"\\mathcal":[54],"such":[56],"that":[57,72,150,211],"\\(I":[58],"\\subseteq":[59],"S\\)":[60],"Lokshtanov":[62,119],"et":[63,120],"al.":[64,121],"(ACM":[65,122],"Transactions":[66,123],"on":[67,124,160],"Algorithms":[68],"2020)":[70,126],"showed":[71],"graphs":[73,139,170,189,215],"degeneracy":[75],"d":[76,178],"admit":[77,140,190,223],"-independence":[79,142,192,225],"families":[81,137,144,194,227],"\\(\\binom{k(d+1)}{k}":[84],"\\cdot":[85,87],"2^{o(kd)}":[86],"\\log":[88],"n\\)":[89],"and":[90,109],"used":[91],"this":[92,207],"result":[93,201],"to":[94,131,206],"design":[95],"efficient":[96],"parameterized":[97],"algorithms":[98],"number":[101],"problems,":[103],"including":[104],"Stable":[105,110],"Odd":[106],"Cycle":[107],"Transversal":[108],"Multicut":[111],"In":[113],"light":[114],"the":[116,183],"results":[117],"Algorithms,":[125],"it":[127],"quite":[129],"natural":[130],"ask":[132],"whether":[133,186],"even":[134,212],"more":[135],"general":[136],"\\(f(k)n^{O(1)}\\)":[147],"Graphs":[149],"exclude":[151],"complete":[153],"bipartite":[154],"\\(K_{d+1,d+1}\\)":[156,167],"with":[157],"\\(d+1\\)":[158],"both":[161],"sides":[162],"as":[163],"subgraph,":[165],"free":[169],"are":[172],"frequently":[174],"considered":[175],"generalization":[176],"-degenerate":[179],"graphs.":[180],"This":[181],"motivates":[182],"question":[184],"\\(K_{d,d}\\)":[187],"-free":[188,214,219],"\\(f(k,d)n^{O(1)}\\)":[197],"Our":[199],"main":[200],"resounding":[204],"\u201cno\u201d":[205],"question\u2014specifically,":[208],"we":[209],"prove":[210],"\\(K_{2,2}\\)":[213],"(or":[216],"equivalently":[217],"\\(C_4\\)":[218],"graphs)":[220],"do":[221],"not":[222],"\\(f(k)n^{\\frac{k}{4}-\\epsilon":[230],"}\\)":[231]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}