In graph theory and computational complexity theory, a Frankl–Rödl graph is a graph defined by connecting pairs of vertices of a hypercube that are at...
9 KB (1,059 words) - 14:11, 3 April 2024
P. Frankl he solved a 1000$ problem of Paul Erdős. Since 2010 Rödl has been a Foreign Fellow of the Czech Learned Society. Nešetřil, Jaroslav; Rödl, Vojtěch...
4 KB (395 words) - 01:44, 20 November 2024
related to Hypercube graphs. de Bruijn graph Cube-connected cycles Fibonacci cube Folded cube graph Frankl–Rödl graph Halved cube graph Hypercube internetwork...
13 KB (1,555 words) - 00:07, 10 May 2025
element that belongs to at least half of the sets in the family. Frankl–Rödl graph http://www.filmfestawards.com US international film & video festival...
7 KB (602 words) - 01:47, 25 April 2024
exactly two. This construction is an instance of the construction of Frankl–Rödl graphs. It produces two subsets of 16 vertices that are disconnected from...
10 KB (1,136 words) - 00:17, 13 December 2023
finding a tight integrality gap for the vertex cover problem using the Frankl–Rödl graphs. He proved with his coauthors essentially that a huge class of semidefinite...
4 KB (312 words) - 09:54, 15 March 2025
Michael (2006), Extremal and Probabilistic Combinatorics (PDF). Frankl, Peter; Rödl, Vojtěch (1987), "Forbidden intersections", Transactions of the American...
3 KB (291 words) - 21:15, 14 February 2025
Hypergraph removal lemma (category Theorems in graph theory)
1002/rsa.3240020208. ISSN 1042-9832. Frankl, P.; Rödl, V. (December 1992). "The Uniformity Lemma for hypergraphs". Graphs and Combinatorics. 8 (4): 309–312...
14 KB (2,349 words) - 22:49, 27 February 2025
Cap set (section Strongly regular graphs)
speaking, this means that cap sets have zero density. Péter Frankl, Ronald Graham, and Vojtěch Rödl have shown in 1987 that the result of Brown and Buhler...
18 KB (2,244 words) - 21:19, 26 January 2025
Ruzsa–Szemerédi problem (category Extremal graph theory)
45–57, arXiv:1512.07852, doi:10.1112/blms.12005, MR 3653100 Frankl, P.; Graham, R. L.; Rödl, V. (1987), "On subsets of abelian groups with no 3-term arithmetic...
17 KB (2,129 words) - 07:35, 24 March 2025
Szemerédi regularity lemma (category Lemmas in graph theory)
Orsay, Orsay, 1976), vol. 260, Paris: CNRS, pp. 399–401, MR 0540024. Frankl, Peter; Rödl, Vojtěch (2002), "Extremal problems on set systems", Random Structures...
39 KB (6,164 words) - 06:47, 12 May 2025
r} -uniform graphs, Erdős, Frankl, and Rödl provided a statement for general graphs very close to the modern graph removal lemma: if graph H 2 {\displaystyle...
32 KB (5,077 words) - 23:54, 9 March 2025