Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On the number of orientations of random graphs with no directed cycles of a given length

Full text
Author(s):
Allen, P. [1] ; Kohayakawa, Y. [2] ; Mota, G. O. [2] ; Parente, R. F. [2]
Total Authors: 4
Affiliation:
[1] London Sch Econ, Dept Math, London WC2A 2AE - England
[2] Univ Sao Paulo, Inst Matemat & Estat, BR-05508090 Sao Paulo - Brazil
Total Affiliations: 2
Document type: Journal article
Source: ELECTRONIC JOURNAL OF COMBINATORICS; v. 21, n. 1 MAR 10 2014.
Web of Science Citations: 0
Abstract

Let (H) over right arrow be an orientation of a graph H. Alon and Yuster proposed the problem of determining or estimating D(n, m, (H) over right arrow), the maximum number of (H) over right arrow -free orientations a graph with n vertices and m edges may have. We consider the maximum number of (H) over right arrow -free orientations of typical graphs G(n, m) with n vertices and m edges. Suppose (H) over right arrow = C-l(((sic))) is the directed cycle of length l >= 3. We show that if m >> n(1+1/(l-1)), then this maximum is 2(o(m)), while m << n(1+1/(l-1)), the it is 2((1-o(1))m). (AU)

FAPESP's process: 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat
Grantee:Oswaldo Baffa Filho
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 10/09555-7 - Embedding, randomised and structural problems in extremal graph theory
Grantee:Peter David Allen
Support Opportunities: Scholarships in Brazil - Post-Doctoral
FAPESP's process: 12/00036-2 - Asymptotic combinatorics of sparse structures and regularity
Grantee:Guilherme Oliveira Mota
Support Opportunities: Scholarships abroad - Research Internship - Doctorate
FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:Carlos Eduardo Ferreira
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 13/20733-2 - Extremal and probabilistic combinatorics
Grantee:Guilherme Oliveira Mota
Support Opportunities: Scholarships abroad - Research Internship - Post-doctor
FAPESP's process: 09/06294-0 - Asymptotic combinatorics of sparse structures and regularity
Grantee:Guilherme Oliveira Mota
Support Opportunities: Scholarships in Brazil - Doctorate