Turán numbers for disjoint copies of graphs (Q659740): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00373-010-0999-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023913113 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4830805 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4342632 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Turán number for the hexagon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc coverings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5548826 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two Turán Numbers / rank | |||
Normal rank |
Latest revision as of 21:23, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turán numbers for disjoint copies of graphs |
scientific article |
Statements
Turán numbers for disjoint copies of graphs (English)
0 references
24 January 2012
0 references
Turán number
0 references
extremal graph
0 references
disjoint copies
0 references