{"id":"https://openalex.org/W7167145901","doi":"https://doi.org/10.4230/lipics.wg.2026.21","title":"Hunting for Directed 2-Spiders","display_name":"Hunting for Directed 2-Spiders","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167145901","doi":"https://doi.org/10.4230/lipics.wg.2026.21"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.wg.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.21","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.4230/lipics.wg.2026.21","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038250666","display_name":"Grzegorz Gutowski","orcid":"https://orcid.org/0000-0003-3313-1237"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Gutowski, Grzegorz","raw_affiliation_strings":["Institute of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"raw_orcid":"https://orcid.org/0000-0003-3313-1237","affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065771769","display_name":"Gaurav Kucheriya","orcid":"https://orcid.org/0000-0002-5254-5198"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Kucheriya, Gaurav","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czechia"],"raw_orcid":"https://orcid.org/0000-0002-5254-5198","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.633400022983551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5766000151634216},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5206999778747559},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43880000710487366},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3741999864578247},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.33379998803138733}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6974999904632568},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6556000113487244},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.633400022983551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5766000151634216},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5206999778747559},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43230000138282776},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2720000147819519},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.wg.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.21","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.wg.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.21","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hons,":[0],"Klimo\u0161ov\u00e1,":[1],"Mik\u0161an\u00edk,":[2],"Tkadlec,":[3],"Tyomkyn":[4],"and":[5],"the":[6,34,48,51,93],"second":[7],"author":[8],"proved":[9],"that,":[10],"for":[11],"every":[12,17,71],"integer":[13],"\ud835\udcc1":[14,27,37],"\u2265":[15],"1,":[16],"directed":[18,72,95],"graph":[19,73,96],"with":[20,36,74,97],"minimum":[21,52,75],"out-degree":[22,53,76],"at":[23,77],"least":[24,78],"3.23":[25],"\u22c5":[26],"contains":[28,80],"a":[29,40,81,85,103],"(2,\ud835\udcc1)-spider":[30],"(a":[31],"1-subdivision":[32],"of":[33],"in-star":[35],"leaves)":[38],"as":[39,84,92],"subgraph.":[41,86],"Hons":[42],"et":[43],"al.":[44],"also":[45],"conjectured":[46],"that":[47,70],"bound":[49],"on":[50],"can":[54],"be":[55],"further":[56],"improved":[57],"to":[58],"2":[59],"\ud835\udcc1.":[60],"In":[61],"this":[62,66],"note,":[63],"we":[64],"confirm":[65],"conjecture":[67],"by":[68],"showing":[69],"2\ud835\udcc1":[79,98],"(2,":[82],"\ud835\udcc1)-spider":[83],"This":[87],"result":[88],"is":[89],"best":[90],"possible,":[91],"complete":[94],"vertices":[99],"does":[100],"not":[101],"contain":[102],"(2,\ud835\udcc1)-spider.":[104]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}