Minimizing the Number of Triangular Edges. (14th August 2017)
- Record Type:
- Journal Article
- Title:
- Minimizing the Number of Triangular Edges. (14th August 2017)
- Main Title:
- Minimizing the Number of Triangular Edges
- Authors:
- GRUSLYS, VYTAUTAS
LETZTER, SHOHAM - Abstract:
- Abstract : We consider the problem of minimizing the number of edges that are contained in triangles, among n -vertex graphs with a given number of edges. For sufficiently large n, we prove an exact formula for this minimum, which partially resolves a conjecture of Füredi and Maleki.
- Is Part Of:
- Combinatorics, probability and computing. Volume 27:Number 4(2018)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 27:Number 4(2018)
- Issue Display:
- Volume 27, Issue 4 (2018)
- Year:
- 2018
- Volume:
- 27
- Issue:
- 4
- Issue Sort Value:
- 2018-0027-0004-0000
- Page Start:
- 580
- Page End:
- 622
- Publication Date:
- 2017-08-14
- Subjects:
- 05C35
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548317000189 ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 6830.xml