Summary.
We prove an unexpected upper bound on a communication game proposed by Jeff Edmonds and Russell Impagliazzo [2, 3] as an approach for proving lower bounds for time-space tradeoffs for branching programs. Our result is based on a generalization of a construction of Erdős, Frankl and Rödl [5] of a large 3-hypergraph with no 3 distinct edges whose union has at most 6 vertices.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
F.A. Behrend, On sets of integers which contain no three in arithmetic progression, Proc. Nat. Acad. Sci. 23 (1946), 331–332.
J. Edmonds and R. Impagliazzo Towards time-space lower bounds on branching programs, manuscript.
J. Edmonds and R. Impagliazzo About time-space bounds for st-connectivity on branching programs, manuscript.
J. Edmonds and R. Impagliazzo A more general communication game related to time-space tradeoffs, manuscript.
P. Erdős, P. Frankl, and V. Rödl, The asymptotic number of graphs not containing a fixed subgraph, Graphs and Combinatorics 2, 113–121 (1986)
R.L. Graham and V. Rödl, Numbers in Ramsey Theory, In: Surveys in combinatorics (ed. I. Anderson), London Mathematical Society lecture note series 103, pp. 111–153,1985.
D.R. Heath-Brown, Integer sets containing no arithmetic progressions, preprint, 1986.
I.Z. Rusza and E. Szemerédi, Triple systems with no six points carrying three triangles, Coli. Math. Soc. Janos Bolyai 18 (1978), pp. 939–945.
E. Szemerédi, Regular partitions of graphs, In : Proc. Coloq. Int. CNRS, Paris, CNRS, 1976, 399–401.
Acknowledgements
We would like to thank Russell Impagliazzo and Jeff Edmonds for many fruitful discussions. We are grateful to Vojta Rödl for pointing to us the literature on the related extremal problems.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pudlák, P., Sgall, J. (2013). An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_24
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7258-2_24
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7257-5
Online ISBN: 978-1-4614-7258-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)