{"id":"https://openalex.org/W7131616477","doi":"https://doi.org/10.37236/11536","title":"Factorizations of Regular Graphs of Infinite Degree","display_name":"Factorizations of Regular Graphs of Infinite Degree","publication_year":2026,"publication_date":"2026-02-13","ids":{"openalex":"https://openalex.org/W7131616477","doi":"https://doi.org/10.37236/11536"},"language":null,"primary_location":{"id":"doi:10.37236/11536","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11536","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p23/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/v33i1p23/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050453067","display_name":"Marcin Stawiski","orcid":"https://orcid.org/0000-0003-2554-1754"},"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":"Marcin Stawiski","raw_affiliation_strings":["AGH University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"AGH University of Science and Technology","institution_ids":["https://openalex.org/I686019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050453067"],"corresponding_institution_ids":["https://openalex.org/I686019"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76566621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","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.3046000003814697,"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.3046000003814697,"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/T10849","display_name":"Finite Group Theory Research","score":0.24130000174045563,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.1234000027179718,"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/graph-factorization","display_name":"Graph factorization","score":0.4772999882698059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41850000619888306},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.41440001130104065},{"id":"https://openalex.org/keywords/strongly-regular-graph","display_name":"Strongly regular graph","score":0.4034999907016754},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.39399999380111694},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.39320001006126404},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.3921000063419342},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.3709000051021576},{"id":"https://openalex.org/keywords/vertex-transitive-graph","display_name":"Vertex-transitive graph","score":0.3547999858856201}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8149999976158142},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7656999826431274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5641000270843506},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4772999882698059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.41440001130104065},{"id":"https://openalex.org/C133875400","wikidata":"https://www.wikidata.org/wiki/Q692823","display_name":"Strongly regular graph","level":5,"score":0.4034999907016754},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.39399999380111694},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.39320001006126404},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.3921000063419342},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.3709000051021576},{"id":"https://openalex.org/C113203676","wikidata":"https://www.wikidata.org/wiki/Q220997","display_name":"Vertex-transitive graph","level":5,"score":0.3547999858856201},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.33640000224113464},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.31779998540878296},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.310699999332428},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.302700012922287},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.2946999967098236},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.27900001406669617},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.2700999975204468},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.26420000195503235},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.25940001010894775},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.25940001010894775},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.25600001215934753},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/11536","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11536","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p23/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/11536","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11536","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p23/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.485222727060318,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7131616477.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0,55],"$\\mathcal{H}=(H_i\\colon":[1],"i<\\alpha":[2,18],")$":[3,19],"for":[4,29,136,140],"some":[5],"ordinal":[6],"number":[7],"$\\alpha$":[8],"be":[9,57],"an":[10,58],"indexed":[11,87],"family":[12,16,112,138],"of":[13,20,23,43,53,91,113,116],"graphs.":[14],"A":[15],"$\\mathcal{G}=(G_i\\colon":[17],"edge-disjoint":[21],"subgraphs":[22],"a":[24,40,51,70,103,111,128,137,142],"graph":[25,68,101,125],"$G$":[26,126],"such":[27,96,141],"that":[28,65,97,107],"every":[30,66,98,122],"$i<\\alpha$:":[31],"$G_i$":[32,38],"is":[33,39,50,110],"isomorphic":[34],"to":[35,79,144],"$H_i$,":[36],"each":[37,115],"spanning":[41],"subgraph":[42],"$G$,":[44],"and":[45],"$E(G)=\\bigcup\\{E(G_i)\\colon":[46],"i":[47],"<":[48],"\\alpha\\}$":[49],"$\\mathcal{H}$-factorization":[52],"$G$.":[54],"$\\kappa$":[56],"infinite":[59],"cardinal.":[60],"K\u0151nig":[61],"proved":[62],"in":[63],"1936":[64],"$\\kappa$-regular":[67,100,124],"has":[69,102,127],"factorization":[71],"into":[72],"perfect":[73],"matchings.":[74],"We":[75,85,105],"extend":[76],"this":[77],"result":[78],"the":[80,132],"most":[81,119,133],"general":[82,134],"factorizations":[83],"possible.":[84],"study":[86],"families":[88],"$\\mathcal{T}=(T_i\\colon":[89],"i<\\kappa)$":[90],"graphs":[92],"without":[93],"isolated":[94],"vertices":[95],"connected":[99,123],"$\\mathcal{T}$-factorization.":[104,129],"prove":[106],"if":[108],"$\\mathcal{T}$":[109,139],"forests":[114],"order":[117],"at":[118],"$\\kappa$,":[120],"then":[121],"These":[130],"are":[131],"assumptions":[135],"statement":[143],"hold.":[145]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2026-02-27T00:00:00"}