{"id":"https://openalex.org/W4405562286","doi":"https://doi.org/10.46298/dmtcs.15361","title":"Partitions of Graphs into Special Bipartite Graphs","display_name":"Partitions of Graphs into Special Bipartite Graphs","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4405562286","doi":"https://doi.org/10.46298/dmtcs.15361"},"language":"en","primary_location":{"id":"doi:10.46298/dmtcs.15361","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.15361","pdf_url":"https://dmtcs.episciences.org/16935/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/16935/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006619586","display_name":"Lajos Gy\u0151rffy","orcid":"https://orcid.org/0000-0002-4606-5390"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lajos Gy\u0151rffy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072982055","display_name":"Andr\u00e1s London","orcid":"https://orcid.org/0000-0003-1957-5368"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andr\u00e1s London","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101418001","display_name":"G\u00e1bor Nagy","orcid":"https://orcid.org/0000-0002-3085-9620"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00e1bor V. Nagy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031238235","display_name":"Andr\u00e1s Pluh\u00e1r","orcid":"https://orcid.org/0000-0001-6576-4202"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andr\u00e1s Pluh\u00e1r","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00514797,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"vol. 27:3","issue":"Graph Theory","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9944999814033508,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7820454239845276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6172032952308655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.530034601688385},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5270612239837646},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.48270702362060547},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.4564085900783539},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.407998263835907},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3928639888763428},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3436925411224365},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18864259123802185}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7820454239845276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6172032952308655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.530034601688385},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5270612239837646},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.48270702362060547},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4564085900783539},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.407998263835907},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3928639888763428},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3436925411224365},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18864259123802185}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/dmtcs.15361","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.15361","pdf_url":"https://dmtcs.episciences.org/16935/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2412.12664","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2412.12664","pdf_url":"https://arxiv.org/pdf/2412.12664","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2412.12664","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2412.12664","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/dmtcs.15361","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.15361","pdf_url":"https://dmtcs.episciences.org/16935/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2953162778","display_name":null,"funder_award_id":"TKP2021-NVA","funder_id":"https://openalex.org/F4320335908","funder_display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap"},{"id":"https://openalex.org/G298428782","display_name":null,"funder_award_id":"TKP2021","funder_id":"https://openalex.org/F4320335908","funder_display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap"},{"id":"https://openalex.org/G4614621299","display_name":null,"funder_award_id":"TKP2021-NVA-09","funder_id":"https://openalex.org/F4320335908","funder_display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap"}],"funders":[{"id":"https://openalex.org/F4320335908","display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4405562286.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4385327816","https://openalex.org/W4220852510","https://openalex.org/W2061237693","https://openalex.org/W603403972","https://openalex.org/W2083238533","https://openalex.org/W2132199417","https://openalex.org/W2152515622","https://openalex.org/W2007560929","https://openalex.org/W1994311645","https://openalex.org/W1583936408"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,10,79,82,89,100,130,136],"problem":[3],"of":[4,9,75,81,92,102,132,139],"partitioning":[5,32,66],"edge":[7,65],"set":[8],"complete":[11,37],"graph":[12,70,150],"into":[13,33],"bipartite":[14,38,69,95],"subgraphs":[15,96,119],"under":[16,68],"certain":[17],"constraints":[18,24],"defined":[19],"by":[20,44,52],"forbidden":[21,118],"subgraphs.":[22],"These":[23],"lead":[25,144],"to":[26,88,98,106,134,145],"both":[27],"classical":[28],"problems,":[29],"such":[30],"as":[31,64],"independent":[34],"matchings":[35],"or":[36,122,148],"subgraphs,":[39],"and":[40,142],"novel":[41,147],"variants":[42],"motivated":[43],"structural":[45],"restrictions.":[46],"Our":[47],"theoretical":[48,151],"framework":[49],"is":[50,78],"inspired":[51],"clustering":[53],"problems":[54,67],"in":[55],"real-world":[56],"transaction":[57],"graphs,":[58],"which":[59,86],"can":[60],"be":[61],"formulated":[62],"naturally":[63],"constraints.":[71],"The":[72],"main":[73],"result":[74],"this":[76,107],"paper":[77],"proof":[80],"bounds":[83,115],"for":[84,116,129],"$\u03c7'_{2K_2}(n)$,":[85],"corresponds":[87],"minimum":[90],"number":[91],"induced":[93],"$2K_2$-free":[94],"needed":[97],"partition":[99],"edges":[101],"$K_n$.":[103],"In":[104],"addition":[105],"central":[108],"result,":[109],"we":[110],"also":[111],"present":[112],"several":[113],"similar":[114],"other":[117,146],"on":[120],"three":[121],"four":[123],"vertices.":[124],"Some":[125],"are":[126],"included":[127],"primarily":[128],"sake":[131],"completeness,":[133],"demonstrate":[135],"broad":[137],"applicability":[138],"our":[140],"approach,":[141],"some":[143],"well-known":[149],"problems.":[152]},"counts_by_year":[],"updated_date":"2026-06-18T10:00:31.954636","created_date":"2024-12-19T00:00:00"}