, Building sdp problem ( forks_density ) on basis : digraph / basis4_type0_id0 (42 flags ) Maximizing :-fork Building Cauchy-Schwartz blocks (3 bases ) Building Inequalities block
, Real Relative Gap : 5.56 e-10 XZ Relative Gap : 9.36 e-10 DIMACS error measures : 8.27
, Print the sdp program in CH. sdpa *) let _ = Problem. write " CH " inequalities
, The program then construct the s.d.p. problem and output the following summary
, Building sdp problem ( CH ) on basis : trianglefree / basis6_type0_id0 (6583 flags ) Maximizing : 1 Building Cauchy-Schwartz blocks (35 bases ) Building Inequalities block (12563 inequalities ) Inequalities list : 1. Outdegree is c (2858) [|, 1429.
, Fork ( expanded ) (1) fork >= 3*(3 c-1)^2/ a (1)
, Sigma-sources (3120) [| ( Sigma sources + ( c1-1). F0-c )
, Enumerating order types for small point sets with applications, Order, vol.19, issue.3, pp.265-281, 2002.
, The point set order type data base: A collection of applications and results, Proceedings of the 13th Canadian Conference on Computational Geometry, pp.17-20, 2001.
, The number of polytopes, configurations and real matroids, Mathematika, vol.33, issue.1, pp.62-71, 1986.
, Easily testable graph properties, Combinatorics, Probability & Computing, vol.24, issue.4, pp.646-657, 2015.
, Testing k-colorability, SIAM J. Discrete Math, vol.15, issue.2, pp.211-227, 2002.
DOI : 10.1137/s0895480199358655
, A characterization of easily testable induced subgraphs, Combinatorics, Probability & Computing, vol.15, issue.6, pp.791-805, 2006.
, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput, vol.37, issue.6, pp.1703-1727, 2008.
, Counting subgraphs a new approach to the caccettahäggkvist conjecture, Discrete Mathematics, pp.71-80, 1997.
DOI : 10.1016/s0012-365x(96)00162-8
URL : https://doi.org/10.1016/s0012-365x(96)00162-8
, Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms, J. Comput. Syst. Sci, vol.13, issue.3, pp.335-379, 1976.
, On minimal digraphs with given girth, Congressus Numerantium, vol.21, pp.181-187, 1978.
, Cycles in dense digraphs, Combinatorica, vol.28, issue.1, pp.1-18, 2008.
DOI : 10.1007/s00493-008-2331-z
, Bounds for graph regularity and removal lemmas. Geometric and Functional Analysis, pp.1-66, 2012.
DOI : 10.1007/s00039-012-0171-x
URL : http://arxiv.org/pdf/1107.4829
, Subsets of finite measure in analytic sets, Indagationes Mathematicae (Proceedings), vol.55, pp.488-489, 1952.
, Destroying cycles in digraphs, Combinatorica, vol.31, issue.1, pp.55-66, 2011.
DOI : 10.1007/s00493-011-2589-4
, A limit theorem in graph theory, In Studia Sci. Math. Hung. Citeseer, 1965.
, Strong marstrand theorems and dimensions of sets formed by subsets of hyperplanes, 2015.
, Turán h-densities for 3-graphs, Electr. J. Comb, vol.19, issue.3, p.40, 2012.
, A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing, 2015.
DOI : 10.1137/15m1007355
URL : http://arxiv.org/pdf/1502.01730
, Efficient removal without efficient regularity, 2017.
DOI : 10.1007/s00493-018-3899-6
URL : http://arxiv.org/pdf/1709.08159
, Removal lemmas with polynomial bounds, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp.510-522, 2017.
DOI : 10.1145/3055399.3055404
URL : http://arxiv.org/pdf/1611.10315
, Limits of order types, 31st International Symposium on Computational Geometry, pp.300-314, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01172466
, Property testing and its connection to learning and approximation, J. ACM, vol.45, issue.4, pp.653-750, 1998.
DOI : 10.1109/sfcs.1996.548493
, Three theorems regarding testing graph properties, Random Struct. Algorithms, vol.23, issue.1, pp.23-57, 2003.
DOI : 10.1002/rsa.10078
, Lower bounds of tower type for szemerédi's uniformity lemma, GAFA, vol.7, issue.2, pp.322-337, 1997.
, On directed triangles in digraphs, Electr. J. Comb, vol.14, issue.1, 2007.
, An application of connectivity theory in graphs to factorizations of elements in groups, Eur. J. Comb, vol.2, issue.4, pp.349-355, 1981.
, Counting flags in triangle-free digraphs, Electronic Notes in Discrete Mathematics, vol.34, pp.621-625, 2009.
, Simultaneous interval graphs, Algorithms and Computation-21st International Symposium, ISAAC 2010, pp.206-217, 2010.
, Standard representation of multivariate functions on a general probability space, Elect. Comm. Probab, vol.14, pp.343-346, 2009.
, Graphons, cut norm and distance, couplings and rearrangements, 2010.
, Leçons Sur L'integration Et la Recherche Des Fonctions Primitives. Collection de monographies sur la théorie des fonctions, 1904.
, Large networks and graph limits, vol.60, 2012.
, Limits of dense graph sequences, J. Comb. Theory, Ser. B, vol.96, issue.6, pp.933-957, 2006.
, Limits of dense graph sequences, Journal of Combinatorial Theory, Series B, vol.96, issue.6, pp.933-957, 2006.
, Some fundamental geometrical properties of plane sets of fractional dimensions, Proc. London Math. Soc, vol.4, issue.3, pp.257-302, 1954.
, Hausdorff dimension, orthogonal projections and intersections with planes, Ann. Acad. Sci. Fenn. Ser. A I Math, vol.1, issue.2, pp.227-244, 1975.
, Practical graph isomorphism. Congressus Numerantium, vol.30, pp.45-87, 1981.
, Practical graph isomorphism, ii, J. Symb. Comput, vol.60, pp.94-112, 2014.
, Varieties of combinatorial types of projective configurations and convex polytopes, Doklady Akademii Nauk SSSR, vol.283, issue.6, pp.1312-1314, 1985.
, Flag algebras, J. Symb. Log, vol.72, issue.4, pp.1239-1282, 2007.
, Directed triangles in digraphs, J. Comb. Theory, Ser. B, vol.74, issue.2, pp.405-407, 1998.
, Funkcje rzeczywiste I. Pa?stwowe Wydawnictwo Naukowe, 1958.
, Real Analysis: Measure Theory, Integration, and Hilbert Spaces (Princeton Lectures in Analysis) (Bk. 3), 2005.