{"id":"https://openalex.org/W2162882170","doi":"https://doi.org/10.37236/1525","title":"A Tur\u00e1n Type Problem Concerning the Powers of the Degrees of a Graph","display_name":"A Tur\u00e1n Type Problem Concerning the Powers of the Degrees of a Graph","publication_year":2000,"publication_date":"2000-08-30","ids":{"openalex":"https://openalex.org/W2162882170","doi":"https://doi.org/10.37236/1525","mag":"2162882170"},"language":"en","primary_location":{"id":"doi:10.37236/1525","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1525","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r47/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":false,"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":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r47/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000697501","display_name":"Yair Caro","orcid":"https://orcid.org/0000-0002-9687-5770"},"institutions":[{"id":"https://openalex.org/I107326029","display_name":"Oranim Academic College of Education","ror":"https://ror.org/01539v588","country_code":"IL","type":"education","lineage":["https://openalex.org/I107326029"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yair Caro","raw_affiliation_strings":["Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel","institution_ids":["https://openalex.org/I107326029"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I107326029","display_name":"Oranim Academic College of Education","ror":"https://ror.org/01539v588","country_code":"IL","type":"education","lineage":["https://openalex.org/I107326029"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel","institution_ids":["https://openalex.org/I107326029"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000697501"],"corresponding_institution_ids":["https://openalex.org/I107326029"],"apc_list":null,"apc_paid":null,"fwci":0.6654,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.695625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"1","first_page":null,"last_page":null},"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/T11476","display_name":"Graph theory and applications","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/combinatorics","display_name":"Combinatorics","score":0.9179799556732178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8692905902862549},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6463488340377808},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5086725354194641},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4546355605125427},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4139360785484314}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9179799556732178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8692905902862549},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6463488340377808},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5086725354194641},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4546355605125427},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4139360785484314},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1525","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1525","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r47/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":false,"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.3008","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.3008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.haifa.ac.il/~raphy/papers/turanlp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.578","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_7/PDF/v7i1r47.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1525","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1525","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r47/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":false,"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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2162882170.pdf","grobid_xml":"https://content.openalex.org/works/W2162882170.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W51439770","https://openalex.org/W65904139","https://openalex.org/W103332142","https://openalex.org/W1510730180","https://openalex.org/W1582742149","https://openalex.org/W1965909513","https://openalex.org/W1989949971","https://openalex.org/W2016480989","https://openalex.org/W2037269150","https://openalex.org/W2049090616","https://openalex.org/W2075290268","https://openalex.org/W4251292291"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W4288278856","https://openalex.org/W2572370460","https://openalex.org/W1976691234"],"abstract_inverted_index":{"For":[0,18,63],"a":[1,12,19,44],"graph":[2,21],"$G$":[3],"whose":[4],"degree":[5],"sequence":[6],"is":[7,48],"$d_{1},\\ldots":[8],",d_{n}$,":[9],"and":[10,80,83],"for":[11,71],"positive":[13],"integer":[14],"$p$,":[15],"let":[16,23],"$e_{p}(G)=\\sum_{i=1}^{n}d_{i}^{p}$.":[17],"fixed":[20],"$H$,":[22],"$t_{p}(n,H)$":[24],"denote":[25],"the":[26,50,60],"maximum":[27],"value":[28],"of":[29,53],"$e_{p}(G)$":[30],"taken":[31],"over":[32],"all":[33],"graphs":[34,65],"with":[35],"$n$":[36],"vertices":[37],"that":[38],"do":[39],"not":[40],"contain":[41],"$H$":[42,66],"as":[43],"subgraph.":[45],"Clearly,":[46],"$t_{1}(n,H)$":[47],"twice":[49],"Tur\u00e1n":[51],"number":[52],"$H$.":[54],"In":[55],"this":[56],"paper":[57],"we":[58,67,74],"consider":[59],"case":[61],"$p&gt;1$.":[62],"some":[64,72],"obtain":[68,76],"exact":[69],"results,":[70],"others":[73],"can":[75],"asymptotically":[77],"tight":[78],"upper":[79],"lower":[81],"bounds,":[82],"many":[84],"interesting":[85],"cases":[86],"remain":[87],"open.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
