On a generalized Erdős–Rademacher problem (Q6057585): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.22768 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3212190075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a theorem of Rademacher-Turán / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5724802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3669452 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting substructures. I: Color critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5548826 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of triangles is more when they have no common vertex / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.22768 / rank | |||
Normal rank | |||
Latest revision as of 18:02, 30 December 2024
scientific article; zbMATH DE number 7746050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a generalized Erdős–Rademacher problem |
scientific article; zbMATH DE number 7746050 |
Statements
On a generalized Erdős–Rademacher problem (English)
0 references
5 October 2023
0 references
color critical graphs
0 references
Erdős-Rademacher problem
0 references
triangle covering number
0 references
0 references
