, B i?3, vol.1
, For small cases, we can provide better bounds
, So h(1) = 1. If ? > 1, we first apply Proposition 8.3 to find an acyclic dominating set A of D. Then we apply Proposition 6.16 to find a dominating set S ? A of A. Note that |S| ? since S is stable, There is an integer such that for every positive integer ?, if D is an ?-dense C 3 -free digraph, then D has a dominating set of size ? . that ?(D) h(?)
, We partition Y into |S| subsets, where for each s ? S, Y s is a subset of N o (s)
, Observe that Y = s?S Y s is dominated by s?S B s , and V \ Y is dominated by S by definition of Y. Thus, B is a dominating set of D
A proof of the barát-thomassen conjecture, Journal of Combinatorial Theory, Series B, vol.124, pp.39-55, 2017. ,
Edge-partitioning a graph into paths: beyond the barát-thomassen conjecture, Combinatorica, pp.1-25, 2018. ,
Journal of Combinatorial Theory, Series B, to appear, and LAGOS, 2017. ,
Additive bases and flows in graphs, SIAM Journal of Discrete Mathematics, vol.32, pp.534-542, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01433822
Coloring tournaments: from local to global, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02181518
Coloring dense digraphs. Combinatorica, to appear, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01990330
Domination and fractional domination in digraphs, Electronic Journal of Combinatorics ,
URL : https://hal.archives-ouvertes.fr/hal-01990176
Triangle-free eulerian tours in graphs with maximum degree at most 4. Discrete mathematics, vol.138, pp.5-14, 1995. ,
Edge-statistics on large graphs, 2018. ,
Additive bases of vector spaces over prime fields, J. Comb. Theory, Ser. A, vol.57, issue.2, pp.203-210, 1991. ,
The polynomial method and restricted sums of congruence classes, Journal of Number Theory, vol.56, issue.2, pp.404-417, 1996. ,
Ramsey-type theorems with forbidden subgraphs, Combinatorica, vol.21, issue.2, pp.155-170, 2001. ,
Decomposing graphs of high minimum degree into 4-cycles, Journal of Graph Theory, vol.79, issue.3, pp.167-177, 2015. ,
Tournaments and colouring, Journal of Combinatorial Theory, Series B, vol.103, issue.1, pp.1-20, 2013. ,
Edge-decomposition of graphs into copies of a tree with four edges, The Electronic Journal of Combinatorics, vol.21, issue.1, pp.1-55, 2014. ,
Edgedecompositions of graphs with high minimum degree, Electronic Notes in Discrete Mathematics, vol.49, pp.115-121, 2015. ,
Uppaluri Siva Ramachandra Murty, et al. Graph theory with applications, vol.290, 1976. ,
Decomposing highly connected graphs into paths of length five, Discrete Applied Mathematics, 2016. ,
Decomposing highly edge-connected graphs into paths of any given length, Journal of Combinatorial Theory, Series B, vol.122, pp.508-542, 2017. ,
Claw-decompositions and tutteorientations, Journal of Graph Theory, vol.52, issue.2, pp.135-146, 2006. ,
Tournaments with near-linear transitive subsets, Journal of Combinatorial Theory, Series B, vol.109, pp.228-249, 2014. ,
The erdös-hajnal conjecture-a survey, Journal of Graph Theory, vol.75, issue.2, pp.178-190, 2014. ,
Domination in tournaments, Journal of Combinatorial Theory, Series B, vol.130, pp.98-113, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01993403
Local search of communities in large graphs, Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp.991-1002, 2014. ,
On the addition of residue classes, Journal of the London Mathematical Society, vol.1, issue.1, pp.30-32, 1935. ,
Graph theory (Graduate texts in mathematics, vol.173, 2005. ,
Edge-disjoint branchings. Combinatorial algorithms, 1973. ,
Ramsey-type theorems, Discrete Applied Mathematics, vol.25, issue.1-2, pp.37-52, 1989. ,
Some remarks on the theory of graphs, Bulletin of the American Mathematical Society, vol.53, issue.4, pp.292-294, 1947. ,
7. very local structure in social networks, Sociological Methodology, vol.37, issue.1, pp.209-256, 2007. ,
Decompositions of regular bipartite graphs, Surveys in combinatorics, 1989 (Siemons), vol.141, pp.115-147, 1989. ,
Local structure can identify and quantify influential global spreaders in large scale social networks, Proceedings of the National Academy of Sciences, p.201710547, 2018. ,
Coloring tournaments: from local to global, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02181518
Large acyclic sets in oriented graphs. Unpublished note, 2012. ,
Inductive representation learning on large graphs, Advances in Neural Information Processing Systems, pp.1024-1034, 2017. ,
On circuit covers, circuit decompositions and euler tours of graphs, Surveys in combinatorics, 1993 (Keele), vol.187, pp.191-210, 1993. ,
Flows and generalized coloring theorems in graphs, Journal of Combinatorial Theory, Series B, vol.26, issue.2, pp.205-216, 1979. ,
An exact algorithm for the maximum weight clique problem in large graphs, AAAI, pp.830-838, 2017. ,
Group connectivity of graphs-a nonhomogeneous analogue of nowhere-zero flow properties, Journal of Combinatorial Theory, Series B, vol.56, issue.2, pp.165-182, 1992. ,
, Fourth international conference on combinatorics, graph theory, and applications, 2011.
Decomposing graphs into paths and trees, Electronic Notes in Discrete Mathematics, vol.61, pp.751-757, 2017. ,
Additive bases and strongly z_2s+1-connectedness, 2017. ,
, Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters, vol.6, pp.29-123, 2009.
Nowhere-zero 3-flows and modulo k-orientations, Journal of Combinatorial Theory, Series B, vol.103, issue.5, pp.587-598, 2013. ,
Concentration for independent permutations, Combinatorics, Probability and Computing, vol.11, pp.163-178, 2002. ,
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree, Journal of Combinatorial Theory, Series B, vol.122, pp.91-108, 2017. ,
Graph colouring and the probabilistic method, vol.23, 2013. ,
Local structure discovery in bayesian networks, 28th Conference on Uncertainty in Artificial Intelligence, vol.15, pp.634-643, 2012. ,
On orientations, connectivity and odd vertex pairings in finite graphs, Canad. J. Math, vol.12, issue.8, pp.555-567, 1960. ,
Triangle-free eulerian tours in graphs with minimum degree at least 6, Tekniska Högskolan i Luleaa. Department of Mathematics, 1997. ,
Nowhere-zero 6-flows, Journal of Combinatorial Theory, Series B, vol.30, issue.2, pp.130-135, 1981. ,
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture, 2012. ,
The voting problem, The American Mathematical Monthly, vol.66, issue.9, pp.761-763, 1959. ,
Grötzsch's theorem dualized, 1976. ,
Decompositions of highly connected graphs into paths of length 3, Journal of Graph Theory, vol.58, issue.4, pp.286-292, 2008. ,
Edge-decompositions of highly connected graphs into paths, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol.78, p.17, 2008. ,
The weak 3-flow conjecture and the weak circular flow conjecture, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.521-529, 2012. ,
Decomposing a graph into bistars, Journal of Combinatorial Theory, Series B, vol.103, issue.4, pp.504-508, 2013. ,
Decomposing graphs into paths of fixed length, Combinatorica, vol.33, issue.1, pp.97-123, 2013. ,
Graph factors modulo k, Journal of Combinatorial Theory, Series B, vol.106, pp.174-177, 2014. ,
A contribution to the theory of chromatic polynomials, Canad. J. Math, vol.6, pp.3-4, 1954. ,
Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proc. 5th British Combinatorial Conf, 1975. ,