{"id":"https://openalex.org/W2023104754","doi":"https://doi.org/10.1007/s00493-003-0016-1","title":"For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?","display_name":"For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2023104754","doi":"https://doi.org/10.1007/s00493-003-0016-1","mag":"2023104754"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-003-0016-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-003-0016-1","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5009459540","display_name":"Deryk Osthus","orcid":"https://orcid.org/0000-0002-3059-4298"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Deryk Osthus*","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","Humboldt-Universitat zu Berlin Institut fur Informatik, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt-Universitat zu Berlin Institut fur Informatik, Germany#TAB#","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111667069","display_name":"Hans J\ufffdrgen Pr\ufffdmel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hans J\ufffdrgen Pr\ufffdmel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026270025","display_name":"Anusch Taraz","orcid":"https://orcid.org/0000-0003-3646-3683"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anusch Taraz","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","Humboldt-Universitat zu Berlin Institut fur Informatik, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt-Universitat zu Berlin Institut fur Informatik, Germany#TAB#","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009459540"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":1.6009,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.788472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"1","first_page":"105","last_page":"150"},"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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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/T11476","display_name":"Graph theory and applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8484976291656494},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8166148662567139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7231504321098328},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5444453954696655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4213069677352905}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8484976291656494},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8166148662567139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7231504321098328},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5444453954696655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4213069677352905}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00493-003-0016-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-003-0016-1","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/62516142-ad21-4788-af07-b7ae1ecfe706","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/62516142-ad21-4788-af07-b7ae1ecfe706","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Osthus, D, Pr\u00f6mel, HJ & Taraz, A 2003, 'For which densities are random triangle-free graphs almost surely bipartite?', Combinatorica, vol. 23, pp. 105-150. https://doi.org/10.1007/s00493-003-0016-1","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W67621383","https://openalex.org/W2051240017","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W2054383364","https://openalex.org/W4235475206","https://openalex.org/W3205099810","https://openalex.org/W2383794966","https://openalex.org/W2989925696","https://openalex.org/W4295911352","https://openalex.org/W1604070393","https://openalex.org/W4288324027","https://openalex.org/W4238183349","https://openalex.org/W2809605638"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}