On the number of homogeneous subgraphs of a graph (Q759767): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q323047 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jack E. Graver / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the combinatorial problems which I would most like to see solved / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on the theory of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5759552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Ramsey type theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finite Ramsey numbers / rank | |||
Normal rank |
Latest revision as of 16:23, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of homogeneous subgraphs of a graph |
scientific article |
Statements
On the number of homogeneous subgraphs of a graph (English)
0 references
1984
0 references
A graph is said to be homogeneous if its edge set is empty or complete (contains all possible edges). G(n) is defined to be the maximum number m such that every graph on n vertices contains at least m homogeneous, vertex induced, subgraphs. The main result of this paper is the pair of inequalities: \(\exp ((0.7214)\log^ 2(n))\geq G(n)\geq \exp ((0.2275)\log^ 2(n))\). The author also proves several related results and discusses several conjectures.
0 references
homogeneous graphs
0 references