{"id":"https://openalex.org/W2767223821","doi":"https://doi.org/10.37236/92","title":"$k$-Cycle Free One-Factorizations of Complete Graphs","display_name":"$k$-Cycle Free One-Factorizations of Complete Graphs","publication_year":2009,"publication_date":"2009-01-07","ids":{"openalex":"https://openalex.org/W2767223821","doi":"https://doi.org/10.37236/92","mag":"2767223821"},"language":"en","primary_location":{"id":"doi:10.37236/92","is_oa":true,"landing_page_url":"https://doi.org/10.37236/92","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r3/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/v16i1r3/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054750597","display_name":"Mariusz Meszka","orcid":"https://orcid.org/0000-0003-0785-9339"},"institutions":[{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Mariusz Meszka","raw_affiliation_strings":["Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Krakw, Poland","Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Krakw, Poland","institution_ids":["https://openalex.org/I686019"]},{"raw_affiliation_string":"Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I686019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054750597"],"corresponding_institution_ids":["https://openalex.org/I686019"],"apc_list":null,"apc_paid":null,"fwci":0.3051,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.68792245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9199000000953674,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8745704889297485},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8338061571121216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6352345943450928},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5648489594459534},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.42279601097106934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38005563616752625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.04324975609779358}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8745704889297485},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8338061571121216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6352345943450928},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5648489594459534},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.42279601097106934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38005563616752625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.04324975609779358}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/92","is_oa":true,"landing_page_url":"https://doi.org/10.37236/92","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r3/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.214.925","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.925","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_16/PDF/v16i1r3.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/92","is_oa":true,"landing_page_url":"https://doi.org/10.37236/92","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r3/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":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2767223821.pdf","grobid_xml":"https://content.openalex.org/works/W2767223821.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W399101440","https://openalex.org/W2004478887","https://openalex.org/W2004773548","https://openalex.org/W2021177558","https://openalex.org/W2043509698","https://openalex.org/W2059891919","https://openalex.org/W2149102431","https://openalex.org/W2767999306","https://openalex.org/W2951091481","https://openalex.org/W4230531851","https://openalex.org/W6631793792","https://openalex.org/W6632182774"],"related_works":["https://openalex.org/W2942859747","https://openalex.org/W3035630862","https://openalex.org/W4307006007","https://openalex.org/W2950710868","https://openalex.org/W3026365154","https://openalex.org/W3035629683","https://openalex.org/W2766909239","https://openalex.org/W2963168358","https://openalex.org/W3042573240","https://openalex.org/W2963743284"],"abstract_inverted_index":{"It":[0],"is":[1],"proved":[2],"that":[3,25],"for":[4],"every":[5,9],"$n\\geq":[6],"3$":[7],"and":[8],"even":[10],"$k\\geq":[11],"4$,":[12],"where":[13],"$k\\neq":[14],"2n$,":[15],"there":[16],"exists":[17],"one-factorization":[18],"of":[19,37,47,52],"the":[20],"complete":[21],"graph":[22,33],"$K_{2n}$":[23],"such":[24],"any":[26,56],"two":[27,57],"one-factors":[28,58],"do":[29],"not":[30],"induce":[31],"a":[32,35,41,60],"with":[34],"cycle":[36],"length":[38],"$k$":[39],"as":[40],"component.":[42],"Moreover,":[43],"some":[44],"infinite":[45],"classes":[46],"one-factorizations,":[48],"in":[49],"which":[50],"lengths":[51],"cycles":[53],"induced":[54],"by":[55],"satisfy":[59],"given":[61],"lower":[62],"bound,":[63],"are":[64],"constructed.":[65]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}