[1] B. Bollobás, On generalized graphs, Acta Math. Acad. Sci. Hungar., 16 (1965) 447–452.
[2] B. Bollobás, The art of mathematics. Coffee time in Memphis, Cambridge University Press, New York, 2006.
[3] C. Bey, Polynomial LYM inequalities, Combinatorica, 25 no. 1 (2005) 19–38.
[4] F. V. Fomin and P. Kaski, Exact exponential algorithms, Communications of the ACM, 56 no. 3 (2013) 80–88.
[5] L. Lovász, Flats in matroids and geometric graphs, Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Academic Press, London-New York, (1977) 45–86.
[6] M. Naor, L. J. Schulman and A. Srinivasan, Splitters and near-optimal derandomization, InProceedings of IEEE 36th Annual Foundations of Computer Science, (1995) 182–191.
[7] M. Cygan, F. V. Fomin, L. Kowalik ,D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk and S. Saurabh, Parameterized algorithms, Springer (2015).
)