Induced subgraphs of given sizes

DOI10.1016/S0012-365X(98)00387-2zbMath0930.05052OpenAlexW1967504232WikidataQ105697144 ScholiaQ105697144MaRDI QIDQ1301633

Bruce L. Rothschild, Vera T. Sós, Paul Erdős, Zoltan Fueredi

Publication date: 30 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00387-2

zbMATH Keywords

spectrumextremal problemsinduced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Unavoidable order-size pairs in hypergraphs -- positive forcing density, The feasibility problem for line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The sum of the squares of the parts of a partition, and some related questions
• An extension of the Erdős-Stone theorem
• Graph spectra
• On the existence of triangulated spheres in 3-graphs, and related problems
• Über ein Problem von K. Zarankiewicz
• On Moore Graphs with Diameters 2 and 3
• On the Erdös-Stone Theorem
• On a problem of K. Zarankiewicz
• On the theory of graphs
• On the structure of linear graphs