{"id":"https://openalex.org/W1544642706","doi":"https://doi.org/10.3233/fi-2012-695","title":"On Families of Weakly Cross-intersecting Set-pairs","display_name":"On Families of Weakly Cross-intersecting Set-pairs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1544642706","doi":"https://doi.org/10.3233/fi-2012-695","mag":"1544642706"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2012-695","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2012-695","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090547771","display_name":"Zolt\u00e1n Kir\u00e1ly","orcid":"https://orcid.org/0000-0002-9815-5793"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Kir\u00e1ly","raw_affiliation_strings":["Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014239594","display_name":"Zolt\u00e1n L\u00f3r\u00e1nt Nagy","orcid":"https://orcid.org/0000-0003-2062-5668"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n L. Nagy","raw_affiliation_strings":["Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086250889","display_name":"D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi","orcid":"https://orcid.org/0000-0003-2970-0943"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi","raw_affiliation_strings":["Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, E\u00f6tv\u00f6s University Budapest, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C. H-1117 Hungary, kiraly@cs.elte.hu; nagyzoltanlorant@gmail.com; dom@cs.elte.hu","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025237352","display_name":"Mirk\u00f3 Visontai","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mirk\u00f3 Visontai","raw_affiliation_strings":["Department of Mathematics, University of Pennsylvania, 209 S. 33rd Street, Philadelphia, PA 19104 USA, mirko@math.upenn.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, 209 S. 33rd Street, Philadelphia, PA 19104 USA, mirko@math.upenn.edu","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3563,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86139481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"117","issue":"1-4","first_page":"189","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9908000230789185,"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.9869999885559082,"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/set","display_name":"Set (abstract data type)","score":0.5289773344993591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4908638596534729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46708178520202637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30103087425231934}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5289773344993591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4908638596534729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46708178520202637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30103087425231934},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2012-695","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2012-695","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1490651508","https://openalex.org/W1569752386","https://openalex.org/W1964432727","https://openalex.org/W2034962669","https://openalex.org/W2036554929","https://openalex.org/W2055204325","https://openalex.org/W2063472176","https://openalex.org/W2068795011","https://openalex.org/W2068871408","https://openalex.org/W2090534913","https://openalex.org/W2514823897"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694"],"abstract_inverted_index":{"Let":[0],"\u2131":[1,22,39,55],"be":[2],"a":[3],"family":[4],"of":[5,7],"pairs":[6],"sets.":[8],"We":[9],"call":[10],"it":[11],"an":[12],"(a,":[13],"b)-set":[14],"system":[15],"if":[16,43],"for":[17,44],"every":[18],"set-pair":[19],"(A,B)":[20],"in":[21],"we":[23,60],"have":[24,61],"that":[25],"|A|":[26],"=":[27,30,36],"a,":[28],"|B|":[29],"b,":[31],"and":[32],"A":[33],"\u2229":[34],"B":[35],"\u00d8.":[37],"Furthermore,":[38],"is":[40],"weakly":[41],"cross-intersecting":[42],"any":[45],"(Ai":[46],",":[47,51],"Bi":[48],"),":[49],"(Aj":[50],"Bj":[52],")":[53],"\u2208":[54],"with":[56],"i":[57],"\u2260":[58],"j":[59],"th":[62]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-19T23:35:23.961156","created_date":"2025-10-10T00:00:00"}