{"id":"https://openalex.org/W1894888243","doi":"https://doi.org/10.37236/368","title":"On the Sharpness of Some Results Relating Cuts and Crossing Numbers","display_name":"On the Sharpness of Some Results Relating Cuts and Crossing Numbers","publication_year":2010,"publication_date":"2010-07-10","ids":{"openalex":"https://openalex.org/W1894888243","doi":"https://doi.org/10.37236/368","mag":"1894888243"},"language":"en","primary_location":{"id":"doi:10.37236/368","is_oa":true,"landing_page_url":"https://doi.org/10.37236/368","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r96/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/v17i1r96/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037054433","display_name":"Laurent Beaudou","orcid":"https://orcid.org/0000-0003-1959-6855"},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Laurent Beaudou","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037779732","display_name":"Drago Bokal","orcid":"https://orcid.org/0000-0003-1196-5476"},"institutions":[{"id":"https://openalex.org/I37696226","display_name":"University of Maribor","ror":"https://ror.org/01d5jce07","country_code":"SI","type":"education","lineage":["https://openalex.org/I37696226"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Drago Bokal","raw_affiliation_strings":["University of Maribor#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Maribor#TAB#","institution_ids":["https://openalex.org/I37696226"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037054433"],"corresponding_institution_ids":["https://openalex.org/I4210099416"],"apc_list":null,"apc_paid":null,"fwci":1.4419,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84422316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.8625533580780029},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7587915658950806},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.7174155712127686},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.625863790512085},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5972610712051392},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5968960523605347},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4627329111099243},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36717724800109863},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15025842189788818},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12236610054969788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06880432367324829},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.05762076377868652}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8625533580780029},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7587915658950806},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.7174155712127686},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.625863790512085},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5972610712051392},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5968960523605347},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4627329111099243},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36717724800109863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15025842189788818},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12236610054969788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06880432367324829},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.05762076377868652},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/368","is_oa":true,"landing_page_url":"https://doi.org/10.37236/368","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r96/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"}],"best_oa_location":{"id":"doi:10.37236/368","is_oa":true,"landing_page_url":"https://doi.org/10.37236/368","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r96/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":[{"id":"https://openalex.org/G5436440561","display_name":null,"funder_award_id":"P1-0297","funder_id":"https://openalex.org/F4320323569","funder_display_name":"Ministrstvo za Izobra\u017eevanje, Znanost in \u0160port"}],"funders":[{"id":"https://openalex.org/F4320323569","display_name":"Ministrstvo za Izobra\u017eevanje, Znanost in \u0160port","ror":"https://ror.org/05tahaz79"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1894888243.pdf","grobid_xml":"https://content.openalex.org/works/W1894888243.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W86126052","https://openalex.org/W94845089","https://openalex.org/W824928995","https://openalex.org/W1586000865","https://openalex.org/W1723997437","https://openalex.org/W1945165232","https://openalex.org/W1967082722","https://openalex.org/W1967638544","https://openalex.org/W1995518672","https://openalex.org/W1999834983","https://openalex.org/W2001442460","https://openalex.org/W2003689202","https://openalex.org/W2005620084","https://openalex.org/W2006582264","https://openalex.org/W2015367356","https://openalex.org/W2029282358","https://openalex.org/W2038643780","https://openalex.org/W2053050026","https://openalex.org/W2062048580","https://openalex.org/W2066782398","https://openalex.org/W2083875786","https://openalex.org/W2099137080","https://openalex.org/W2333310721","https://openalex.org/W2799004609","https://openalex.org/W2951743866","https://openalex.org/W4248035917","https://openalex.org/W4285719527","https://openalex.org/W6826238873"],"related_works":["https://openalex.org/W2084086280","https://openalex.org/W2027198738","https://openalex.org/W2397767885","https://openalex.org/W2083114070","https://openalex.org/W237421766","https://openalex.org/W3013712002","https://openalex.org/W2004392729","https://openalex.org/W2057360542","https://openalex.org/W2010164741","https://openalex.org/W136166990"],"abstract_inverted_index":{"It":[0],"is":[1,18,74,85,94],"already":[2],"known":[3],"that":[4,43,81,101],"for":[5,58],"very":[6],"small":[7],"edge":[8,59],"cuts":[9,60],"in":[10,39],"graphs,":[11],"the":[12,16,21,24,33,82,89,92,102,108],"crossing":[13,25],"number":[14,26],"of":[15,23,27,61,91],"graph":[17,48],"at":[19,95],"least":[20,96],"sum":[22],"(slightly":[28],"augmented)":[29],"components":[30],"resulting":[31],"from":[32],"cut.":[34],"Under":[35],"stronger":[36,72],"connectivity":[37],"condition":[38,73,84],"each":[40],"cut":[41,93,109],"component":[42],"was":[44,56,68],"formalized":[45],"as":[46],"a":[47,53,65],"operation":[49],"called":[50],"zip":[51],"product,":[52],"similar":[54],"result":[55],"obtained":[57],"any":[62],"size,":[63],"and":[64,98],"natural":[66],"question":[67],"asked,":[69],"whether":[70],"this":[71,77],"necessary.":[75],"In":[76],"paper,":[78],"we":[79,99],"prove":[80,100],"relaxed":[83],"not":[86],"sufficient":[87],"when":[88],"size":[90],"four,":[97],"gap":[103],"can":[104],"grow":[105],"quadratically":[106],"with":[107],"size.":[110]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}