User:Alper Ferudun

Alper Ferudun is an independent researcher in combinatorics and extremal graph theory, with a focus on Erdős-type problems and computer-assisted proofs. Home page: https://eulersolve.org/ . His arXiv work includes "Exact 6-cut rigidity and small-order superconnectivity for the 6-regular case of Dirac's k=4 problem" (arXiv:2606.18462) and a computer-assisted note on the Erdős triangle-free max-cut conjecture (Erdős problem #23); accompanying code and certificates are at https://github.com/AlperTheKing . He would like to contribute references and computed values for integer sequences arising in extremal graph theory, beginning with A389646 (the maximum number of edges that must be removed from a triangle-free graph to make it bipartite).