\begin{thebibliography}{99}
\bibitem{CP} E.~Cs\'oka and A.~Pongr\'acz,
\emph{Finding cliques and dense subgraphs using edge queries},
Discrete Mathematics \textbf{349}(10) (2026), 115226.
\href{https://doi.org/10.1016/j.disc.2026.115226}{doi:10.1016/j.disc.2026.115226}.
Preprint: \href{https://arxiv.org/abs/2310.06826}{arXiv:2310.06826}.

\bibitem{FGNRT} U.~Feige, D.~Gamarnik, J.~Neeman, M.~Z.~R\'acz,
and P.~Tetali, \emph{Finding cliques using few probes},
Random Structures \& Algorithms \textbf{56}(1) (2020), 142--153.
\href{https://doi.org/10.1002/rsa.20896}{doi:10.1002/rsa.20896}.

\bibitem{FF} U.~Feige and T.~Ferster,
\emph{A tight bound for the clique query problem in two rounds},
arXiv:2112.06072 (2021).
\url{https://arxiv.org/abs/2112.06072}.

\bibitem{Konig} D.~K\H{o}nig, \emph{Graphok \'es matrixok},
Matematikai \'es Fizikai Lapok \textbf{38} (1931), 116--119.
English translation by G.~Sz\'arnyas, arXiv:2009.03780 (2020),
\url{https://arxiv.org/abs/2009.03780}.

\bibitem{EG} P.~Erd\H{o}s and T.~Gallai,
\emph{On maximal paths and circuits of graphs},
Acta Mathematica Academiae Scientiarum Hungaricae \textbf{10}
(1959), 337--356.
\url{https://users.renyi.hu/~p_erdos/1959-10.pdf}.

\bibitem{Tutte} W.~T.~Tutte, \emph{The factorization of linear graphs},
Journal of the London Mathematical Society \textbf{22}(2) (1947), 107--111.
\href{https://doi.org/10.1112/jlms/s1-22.2.107}{doi:10.1112/jlms/s1-22.2.107}.

\bibitem{Berge} C.~Berge, \emph{Two theorems in graph theory},
Proceedings of the National Academy of Sciences of the USA
\textbf{43}(9) (1957), 842--844.
\href{https://doi.org/10.1073/pnas.43.9.842}{doi:10.1073/pnas.43.9.842}.

\bibitem{Schrijver} A.~Schrijver,
\emph{Tutte--Berge $\Rightarrow$ Gallai $\Rightarrow$ Mader}, seminar notes,
\url{https://homepages.cwi.nl/~lex/files/mader_gallai_tutteb.pdf},
accessed 9 November 2026.

\bibitem{Lovasz} L.~Lov\'asz, \emph{Large Networks and Graph Limits},
American Mathematical Society Colloquium Publications, vol.~60,
American Mathematical Society, Providence, RI, 2012.
\href{https://doi.org/10.1090/coll/060}{doi:10.1090/coll/060}.

\bibitem{PP} H.~Peyrl and P.~A.~Parrilo,
\emph{Computing sum of squares decompositions with rational coefficients},
Theoretical Computer Science \textbf{409}(2) (2008), 269--281.
\href{https://doi.org/10.1016/j.tcs.2008.09.025}{doi:10.1016/j.tcs.2008.09.025}.
\end{thebibliography}