Advertisement

On the Prague Dimension of Kneser Graphs

  • Zoltán Füredi
Chapter

Abstract

In this note we point out another connection between the Prague dimension of graphs and the dimension theory of partially ordered sets by giving a very short proof of a theorem of Poljak, Pultr and Rödl [10]. We show that the dimension of the Kneser graph is bounded as dim P(K(n, k)) < C k log log n, where C k is depending only on k.

Keywords

Linear Extension Dimension Theory Boolean Lattice National Security Agency Kneser Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Dushnik, “Concerning a certain set of arrangements”, Proc. Amer. Math. Soc. 1, 1950, 788–796.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Z. Füredi, “Scrambling permutations and entropy of hypergraphs”, Random Structures and Algorithms 8, 1996, 97–104.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    Z. Füredi, P. Hajnal, V. Rödl, and W. T. Trotter, “Interval orders and shift graphs”, Sets, Graphs and Numbers, A. Hajnal and V. T. Sós, Eds., Proc. Colloq. Math. Soc. Jcínos Bolyai 60, 297–313, (Budapest, Hungary, 1991), North-Holland, Amsterdam 1992, 297–313.Google Scholar
  4. [4]
    L. Gargano, J. Körner and U. Vaccaro, “Capacity and dimension”, Lecture by J. Körner, Symposium Numbers, Information and Complexity in honor of R. Ahlswede, Bielefeld, Germany, October 1998.Google Scholar
  5. [5]
    H. A. Kierstead, “On the order dimension of 1-sets versus k-sets”, J. Combin. Theory Ser. A 73, 1996, 219–228.MathSciNetMATHGoogle Scholar
  6. [6]
    J. Körner and A. Monti, “Compact representations of the intersection structure of families of finite sets”, manuscript, November 1998.Google Scholar
  7. [7]
    J. Körner and A. Orlitzky, “Zero-error information theory”, IEEE Trans. Information Theory, 50’th anniversary volume, to appear.Google Scholar
  8. [8]
    L. Lovâsz, J. Nesetril and A. Pultr, “On the product dimension of graphs”, J. Combin. Theory Ser. B 29, 1980, 47–67.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    J. Nesetril and A. Pultr, “A Dushnik-Miller type dimension of graphs and its complexity”, Fundamentals of Computation Theory, Proc. Conf. Poznan—Kórnik, 1977, Springer Lect. Notes in Comp. Sci. 56, 1977, 48 2493.Google Scholar
  10. [10]
    S. Poljak, A. Pultr and V. Rödl, “On the dimension of Kneser graphs”, Algebraic Methods in Graph Theory, Proc. Colloq. in Szeged, Hungary, 1978, L. Lovâsz and V. T. Sós, Eds., Proc. Colloq. Math. Soc. J. Bolyai 25, 1981, 631–646.Google Scholar
  11. [11]
    S. Poljak, A. Pultr and V. Rödl, “On qualitatively independent partitions and related problems”, Discrete Applied Math. 6, 1983, 193–205.MATHCrossRefGoogle Scholar
  12. [12]
    J. Spencer, “Minimal scrambling sets of simple orders”, Acta. Math. Hun-gar. 22, 1972, 349–353.MATHCrossRefGoogle Scholar
  13. [13]
    W.T. Trotter, Cornbinatorics and Partially Ordered Sets: Dimension Theory, John Hopkins University Press, Baltimore, Maryland, 1991. Also: “Progress and new directions in dimension theory for finite partially ordered sets”, Extremal Problems for Finite Sets, Proc. Colloq., Visegrâd, Hungary, 1991, P. Frankl et al., Eds., Bolyai Soc. Math. Studies 3, 1994, 457–477.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Zoltán Füredi
    • 1
    • 2
  1. 1.Department of MathematicsUniversity of IllinoisUrbanaUSA
  2. 2.Mathematical Institute of Hungarian AcademyBudapestHungary

Personalised recommendations