Intersecting Families , Independent Sets and Coloring of Certain Graph Products
暂无分享,去创建一个
[1] Y. Rinott,et al. A remark on quadrant normal probabilities in high dimensions , 2001 .
[2] S. Safra,et al. Noise-Resistant Boolean-Functions are Juntas , 2003 .
[3] Norihide Tokushige. Multiply-intersecting families revisited , 2007, J. Comb. Theory, Ser. B.
[4] Rudolf Ahlswede,et al. The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..
[5] Zoltán Füredi,et al. Beyond the Erdös-Ko-Rado theorem , 1991, J. Comb. Theory, Ser. A.
[6] Ehud Friedgut,et al. On the measure of intersecting families, uniqueness and stability , 2008, Comb..
[7] Ehud Friedgut,et al. Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..
[8] A. J. Hoffman,et al. ON EIGENVALUES AND COLORINGS OF GRAPHS, II , 1970 .
[9] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[10] Nathan Linial,et al. Collective Coin Flipping , 1989, Adv. Comput. Res..
[11] Assaf Naor,et al. Boolean functions whose Fourier transform is concentrated on the first two levels , 2002, Adv. Appl. Math..
[12] Richard M. Wilson,et al. The exact bound in the Erdös-Ko-Rado theorem , 1984, Comb..
[13] J. Bourgain. On the distribution of the fourier spectrum of Boolean functions , 2002 .
[14] N. Alon,et al. Independent sets in tensor graph powers , 2007 .
[15] N. Alon,et al. Graph Products, Fourier Analysis and Spectral Techniques , 2004 .
[16] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .
[17] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[18] L. Lovász,et al. Applications of product colouring , 1974 .
[19] Norihide Tokushige,et al. The Erdős–Ko–Rado Theorem for Integer Sequences , 1999, Comb..
[20] Hans-Dietrich O. F. Gronau. More on the Erdös-Ko-Rado Theorem for Integer Sequences , 1983, J. Comb. Theory, Ser. A.
[21] Rudolf Ahlswede,et al. The Diametric Theorem in Hamming Spaces-Optimal Anticodes , 1998 .
[22] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .
[23] David R. Karger,et al. An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.
[24] J. N. Ridley,et al. THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS , 1988 .
[25] Christian Bey,et al. Old and New Results for the Weighted t-Intersection Problem via AK-Methods , 2000 .
[26] M. L Livingston. An Ordered Version of the Erdös-Ko-Rado Theorem , 1979, J. Comb. Theory, Ser. A.
[27] Michael Langberg,et al. Graphs with tiny vector chromatic numbers and huge chromatic numbers , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[28] Douglas F. Rall,et al. The Ultimate Categorical Independence Ratio of a Graph , 1996, SIAM J. Discret. Math..
[29] Elchanan Mossel,et al. Conditional Hardness for Approximate Coloring , 2009, SIAM J. Comput..
[30] R. Motwani,et al. Approximate Graph Coloring by Semide nite , 1994 .
[31] Gyula O. H. Katona. A simple proof of the Erd?s-Chao Ko-Rado theorem , 1972 .
[32] C. Borell. Geometric bounds on the Ornstein-Uhlenbeck velocity process , 1985 .
[33] Hamed Hatami,et al. Fourier analysis and large independent sets in powers of complete graphs , 2008, J. Comb. Theory, Ser. B.
[34] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[35] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[36] Chris D. Godsil,et al. Eigenvalue bounds for independent sets , 2008, J. Comb. Theory, Ser. B.
[37] Venkatesan Guruswami,et al. On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..
[38] Ryan O'Donnell,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[39] Sanjeev Arora,et al. New approximation guarantee for chromatic number , 2006, STOC '06.
[40] Norihide Tokushige,et al. Weighted multiply intersecting families , 2003 .
[41] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[42] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[43] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.