The Library
Counting flags in triangle-free digraphs
Tools
Tools
Tools
Hladký, Jan, Král', Daniel and Norin, Sergey (2009) Counting flags in triangle-free digraphs. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 621-625. doi:10.1016/j.endm.2009.07.105
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.endm.2009.07.105
Abstract
We prove that every digraph on n vertices with minimum out-degree 0.3465n contains an oriented triangle. This improves the bound of 0.3532n of Hamburger, Haxell and Kostochka. The main tool for our proof is the theory of flag algebras developed recently by Razborov.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Electronic Notes in Discrete Mathematics | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 1571-0653 | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.34 | ||||
| Page Range: | pp. 621-625 | ||||
| DOI: | 10.1016/j.endm.2009.07.105 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
