On extensions of a conjecture of Gallai (Q1362102): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On constructive methods in the theory of colour-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs of colour-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4848779 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On complete subgraphs of color-critical graphs / rank | |||
Normal rank |
Latest revision as of 17:53, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On extensions of a conjecture of Gallai |
scientific article |
Statements
On extensions of a conjecture of Gallai (English)
0 references
12 August 1997
0 references
The authors show that in a \(k\)-critical graph \((k\geq 3)\) with more than \(k\) vertices, there exists an edge that is in fewer than \(2k/5\) cliques of size \(k-1\). They use this result to prove that if \(G\) is a \(k\)-critical graph of order \(n>k\geq 3\), then \(G\) contains fewer than \(n-3k/5+2\) complete subgraphs of order \(k-1\).
0 references
conjecture of Gallai
0 references
\(k\)-critical graph
0 references
complete subgraphs
0 references