Axenovich, M., Weber, L. (2021). Absolutely avoidable order-size pairs for induced subgraphs. arXiv preprint arXiv:2106.14908.

Bennett, M. (2018). Bounds on sizes of general caps in AG (n, q) via the Croot-Lev-Pach polynomial method. arXiv preprint arXiv:1806.05303.
https://doi.org/10.1016/j.jcta.2019.06.001

Bose, R. C., Ray-Chaudhuri, D.K. (1960). On a Class of Error Correcting Binary
https://doi.org/10.1016/S0019-9958(60)90287-4

Group Codes. Information and Control 3, pp. 68-79

Caro, Y., Lauri, J., Zarb, C. (2021). The feasibility problem for line graphs. arXiv preprint arXiv:2107.13806.

Croot, E., Lev, V. F., Pach, P. P. (2017). Progression-free sets in are exponentially small. Annals of Mathematics, 331-337.
https://doi.org/10.4007/annals.2017.185.1.7

Ellenberg, J. S., Gijswijt, D. (2017). On large subsets of with no three-term arithmetic progression. Annals of Mathematics, 339-343.
https://doi.org/10.4007/annals.2017.185.1.8

Erdős, P., Füredi, Z., Rothschild, B. L., Sós, V. T. (1999). Induced subgraphs of given sizes. Discrete mathematics, 200(1-3), 61-77.
https://doi.org/10.1016/S0012-365X(98)00387-2

Guruswami, V. (2011). Linear-algebraic list decoding of folded reed-solomon codes, in Proceedings of the 26th IEEE Conference on Computational Complexity.
https://doi.org/10.1109/CCC.2011.22

He, J., Ma, J., Zhao, L. (2021). Improvements on induced subgraphs of given sizes. arXiv preprint arXiv:2101.03898

Pudlák, P., Rödl, V. (2004). Pseudorandom sets and explicit constructions of Ramsey graphs. Quaderni di Matematica, 13, 327-346.

Sudakov, B., Tomon, I. (2022). The extremal number of tight cycles. International Mathematics Research Notices, 2022(13), 9663-9684.
https://doi.org/10.1093/imrn/rnaa396

Tait, M., Won, R. (2021). Improved Bounds on Sizes of Generalized Caps in AG(n,q). SIAM Journal on Discrete Mathematics, 35(1), 521-531.
https://doi.org/10.1137/20M1369439