{"id":"https://openalex.org/W2068434995","doi":"https://doi.org/10.1017/s0963548305007108","title":"Triangle-Free Hypergraphs","display_name":"Triangle-Free Hypergraphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2068434995","doi":"https://doi.org/10.1017/s0963548305007108","mag":"2068434995"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548305007108","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548305007108","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5010046232","display_name":"Ervin Gy\u0151ri","orcid":"https://orcid.org/0000-0001-5691-2242"},"institutions":[{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"ERVIN GY\u0150RI","raw_affiliation_strings":["Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary (e-mail:","Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary (e-mail: [email\u00a0protected])#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary (e-mail:","institution_ids":["https://openalex.org/I127817813"]},{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary (e-mail: [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I127817813"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010046232"],"corresponding_institution_ids":["https://openalex.org/I127817813"],"apc_list":null,"apc_paid":null,"fwci":1.4099,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.79065817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"15","issue":"1-2","first_page":"185","last_page":"191"},"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.9991999864578247,"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.9991999864578247,"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/T11797","display_name":"graph theory and CDMA systems","score":0.996999979019165,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9832000136375427,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8355604410171509},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7657192945480347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6280465722084045},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.568865180015564},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5357733368873596},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.430764377117157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39955079555511475},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21415585279464722},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06562522053718567}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8355604410171509},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7657192945480347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6280465722084045},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.568865180015564},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5357733368873596},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.430764377117157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39955079555511475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21415585279464722},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06562522053718567}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548305007108","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548305007108","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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":2,"referenced_works":["https://openalex.org/W2017786676","https://openalex.org/W2021817919"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2516280752","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086","https://openalex.org/W3143578817"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,29],"give":[4],"sharp":[5],"upper":[6],"bounds":[7],"on":[8],"the":[9,32,35,38],"maximum":[10],"number":[11],"of":[12,23,34,37],"edges":[13],"in":[14,40],"very":[15],"unbalanced":[16],"bipartite":[17],"graphs":[18],"not":[19],"containing":[20],"any":[21],"cycle":[22],"length":[24],"6.":[25],"To":[26],"prove":[27],"this,":[28],"estimate":[30],"roughly":[31],"sum":[33],"sizes":[36],"hyperedges":[39],"triangle-free":[41],"multi-hypergraphs.":[42]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}