Regular subgraphs of dense graphs (Q1078194): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Regular subgraphs of almost regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the combinatorial problems which I would most like to see solved / rank | |||
Normal rank | |||
Revision as of 13:57, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regular subgraphs of dense graphs |
scientific article |
Statements
Regular subgraphs of dense graphs (English)
0 references
1985
0 references
Main theorem: Every graph on n vertices with at least \(C_ Kn\) log n edges contains a k-regular subgraph. A short proof of this theorem is given based on an ingenous lemma of \textit{N. Alon, S. Friedland} and \textit{G. Kalai} [J. Comb. Theory., Ser. B 37, 79-91 (1984; Zbl 0527.05059)]. The result has been conjectured by Erdős and Sauer.
0 references
subgraph
0 references
regularity
0 references
k-regular subgraph
0 references
