{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q595677","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q595677","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q595677","kernelVersion":"v1","immutable":true,"modified":"2026-01-05T13:51:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q595677","name":"On unavoidable graphs","headline":"On unavoidable graphs","description":"scientific article; zbMATH DE number 3836080","url":"https://portal.mardi4nfdi.de/entity/Q595677","datePublished":"1983-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q920938"},{"@id":"https://portal.mardi4nfdi.de/entity/Q6480801"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q168579"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/BF02579290","url":"https://doi.org/10.1007/BF02579290"},"sameAs":["https://doi.org/10.1007/BF02579290"],"comment":"A graph \\(G\\) is called an \\((n,e)\\)-unavoidable graph if every graph on \\(n\\) vertices and \\(e\\) edges contains \\(G\\) as a subgraph. Let \\(f(n,e)\\) denote the largest integer \\(m\\) with the property that there exists an \\((n,e)\\)-unavoidable graph on \\(m\\) edges. In this paper the authors obtain bounds on \\(f(n,e)\\) which are in many cases asymptotically best possible.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3958492"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1245238"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4748169"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1168327"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1167190"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5826301"}]},"provenance":{"prov:generatedAtTime":"2026-01-05T13:51:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}