A Bound on the Number of Edges in Graphs Without an Even Cycle. (7th April 2016)
- Record Type:
- Journal Article
- Title:
- A Bound on the Number of Edges in Graphs Without an Even Cycle. (7th April 2016)
- Main Title:
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Authors:
- BUKH, BORIS
JIANG, ZILIN - Abstract:
- Abstract : We show that, for each fixed k, an n -vertex graph not containing a cycle of length 2 k has at most $80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$ edges.
- Is Part Of:
- Combinatorics, probability and computing. Volume 26:Number 1(2017:Jan.)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 26:Number 1(2017:Jan.)
- Issue Display:
- Volume 26, Issue 1 (2017)
- Year:
- 2017
- Volume:
- 26
- Issue:
- 1
- Issue Sort Value:
- 2017-0026-0001-0000
- Page Start:
- 1
- Page End:
- 15
- Publication Date:
- 2016-04-07
- Subjects:
- Primary 05C35, -- Secondary 05D99, -- 05C38
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548316000134 ↗
- 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:
- 1628.xml