Supersaturated graphs and hypergraphs (Q787158): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q97694620, #quickstatements; #temporary_batch_1705957399925 |
Created claim: DBLP publication ID (P1635): journals/combinatorica/ErdosS83, #quickstatements; #temporary_batch_1731505720702 |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Miklós Simmonovits / rank | |||
Property / reviewed by | |||
Property / reviewed by: L'udovít Niepel / rank | |||
Property / author | |||
Property / author: Miklós Simmonovits / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: L'udovít Niepel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On complete subgraphs of different orders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Structure of Edge Graphs II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5724802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On extremal problems of graphs and generalized graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some extremal problems on \(r\)-graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compactness results in extremal graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of linear graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3669452 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02579292 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2115730400 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/combinatorica/ErdosS83 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:57, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Supersaturated graphs and hypergraphs |
scientific article |
Statements
Supersaturated graphs and hypergraphs (English)
0 references
1983
0 references
In this paper are investigated supersaturated graphs and hypergraphs. Let \(\mathcal L\) be a family of graphs (hypergraphs) and ex \((n,\mathcal L)\) denote the maximum number of edges (hyperedges) of a graph (hypergraph) on \(n\) vertices which do not contain a subgraph from \(\mathcal L\). A graph (hypergraph) with \(n\) vertices containing more than \(\text{ex}(n,\mathcal L)\) edges es called a supersaturated graph (hypergraph). The problem solved in this paper is to determine the number of copies of a subgraph from \(\mathcal L\) which must occur in a supersaturated graph (hypergraph) with \(\text{ex}(n,\mathcal L)+k\) edges. There are given some lower bounds for the number of subgraphs from \(\mathcal L\) with respect to value of \(k\). In the case of ordinary graphs the characterisation of supersaturated graphs with a low number of prohibited subgraphs is given.
0 references
uniform hypergraph
0 references
forbidden subgraphs
0 references
Turan graphs
0 references
supersaturated hypergraph
0 references