Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeff Kahn
2010 – today
- 2013
[j51]L. Ilinca, Jeff Kahn: Asymptotics of the Upper Matching Conjecture. J. Comb. Theory, Ser. A 120(5): 976-983 (2013)- [j50]
- [j49]Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász: Left and right convergence of graphs with bounded degree. Random Struct. Algorithms 42(1): 1-28 (2013)
- [i2]Arnab Bhattacharyya, Jeff Kahn: A bipartite graph with non-unimodal independent set sequence. CoRR abs/1301.1752 (2013)
- 2012
- [j48]Bobby DeMarco, Jeff Kahn: Upper tails for triangles. Random Struct. Algorithms 40(4): 452-459 (2012)
- [j47]Jeff Kahn, M. Neiman: Conditional negative association for competing urns. Random Struct. Algorithms 41(2): 262-281 (2012)
- [i1]
- 2011
- [j46]Jeff Kahn, Michael Saks, Clifford D. Smyth: The Dual BKR Inequality and Rudich's Conjecture. Combinatorics, Probability & Computing 20(2): 257-266 (2011)
- [j45]Jeff Kahn, M. Neiman: A strong log-concavity property for measures on Boolean algebras. J. Comb. Theory, Ser. A 118(6): 1749-1760 (2011)
- 2010
- [j44]Jeff Kahn, M. Neiman: Negative correlation and log-concavity. Random Struct. Algorithms 37(3): 367-388 (2010)
2000 – 2009
- 2009
- [j43]
- [j42]Bill Cuckler, Jeff Kahn: Entropy bounds for perfect matchings and Hamiltonian cycles. Combinatorica 29(3): 327-335 (2009)
- [j41]L. Ilinca, Jeff Kahn: On the Number of 2-SAT Functions. Combinatorics, Probability & Computing 18(5): 749-764 (2009)
- 2008
- [j40]Anders Johansson, Jeff Kahn, Van H. Vu: Factors in random graphs. Random Struct. Algorithms 33(1): 1-28 (2008)
- 2007
- [j39]Jeff Kahn, G. I. L. Kalai: Thresholds and Expectation Thresholds. Combinatorics, Probability & Computing 16(3): 495-502 (2007)
- 2006
- [j38]Jacob van den Berg, Olle Häggström, Jeff Kahn: Some conditional correlation inequalities for percolation and related processes. Random Struct. Algorithms 29(4): 417-435 (2006)
- 2004
- [j37]David Galvin, Jeff Kahn: On Phase Transition in the Hard-Core Model on Math. Combinatorics, Probability & Computing 13(2): 137-164 (2004)
- 2002
- [c8]Ehud Friedgut, Jeff Kahn, Avi Wigderson: Computing Graph Properties by Randomized Subcube Partitions. RANDOM 2002: 105-113
- 2001
- [j36]Jeff Kahn, János Komlós: Singularity Probabilities For Random Matrices Over Finite Fields. Combinatorics, Probability & Computing 10(2): 137-157 (2001)
- 2000
- [j35]
- [j34]Jeff Kahn: Asymptotics of the list-chromatic index for multigraphs. Random Struct. Algorithms 17(2): 117-156 (2000)
- [c7]Jeff Kahn, Michael E. Saks, Clifford D. Smyth: A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. IEEE Conference on Computational Complexity 2000: 98-103
- [c6]Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu: The Cover Time, the Blanket Time, and the Matthews Bound. FOCS 2000: 467-475
1990 – 1999
- 1999
- [j33]Jeff Kahn, Alexander Lawrenz: Generalized Rank Functions and an Entropy Argument. J. Comb. Theory, Ser. A 87(2): 398-403 (1999)
- 1998
- [j32]Jeff Kahn, Yang Yu: Log-Concave Functions And Poset Probabilities. Combinatorica 18(1): 85-99 (1998)
- [j31]
- 1997
- [j30]Jeff Kahn, P. Mark Kayll: On the Stochastic Independence Properties of Hard-Core Distributions. Combinatorica 17(3): 369-391 (1997)
- [j29]Jeff Kahn, P. Mark Kayll: Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size. J. Comb. Theory, Ser. A 78(2): 199-235 (1997)
- 1996
- [j28]Jeff Kahn, Nathan Linial, Alex Samorodnitsky: Inclusion-Exclusion: Exact and Approximate. Combinatorica 16(4): 465-477 (1996)
- [j27]Jeff Kahn: Asymptotics of the Chromatic Index for Multigraphs. J. Comb. Theory, Ser. B 68(2): 233-254 (1996)
- [j26]
- [j25]Jeff Kahn: A linear programming perspective on the Frankl - Rödl - Pippenger theorem. Random Struct. Algorithms 8(2): 149-157 (1996)
- 1995
- [j24]
- 1994
- [j23]Jeff Kahn, Gil Kalai: A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs. J. Comb. Theory, Ser. A 68(2): 317-339 (1994)
- 1993
- [j22]Zoltán Füredi, Jeff Kahn, Paul D. Seymour: On the fractional matching polytope of a hypergraph. Combinatorica 13(2): 167-180 (1993)
- 1992
- [j21]Jeff Kahn, Paul D. Seymour: A fractional version of the Erdös-Faber-Lovász conjecture. Combinatorica 12(2): 155-160 (1992)
- [j20]Jeff Kahn: On a problem of Erdös and Lovász: random lines in a projective plane. Combinatorica 12(4): 417-423 (1992)
- [j19]Jeff Kahn: Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors. J. Comb. Theory, Ser. A 59(1): 31-39 (1992)
- [c5]
- 1991
- [j18]
- [j17]Jeff Kahn, Nathan Linial: Balancing extensions via Brunn-Minkowski. Combinatorica 11(4): 363-368 (1991)
- 1990
- [j16]Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman: Sphere coverings of the hypercube with incomparable centers. Discrete Mathematics 83(1): 129-134 (1990)
1980 – 1989
- 1989
- [j15]Endre Boros, Zoltán Füredi, Jeff Kahn: Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory, Ser. A 52(1): 1-9 (1989)
- [j14]Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen: Single-Suit Two-Person Card Play III. The Misère Game. SIAM J. Discrete Math. 2(3): 329-343 (1989)
- [c4]Joel Friedman, Jeff Kahn, Endre Szemerédi: On the Second Eigenvalue in Random Regular Graphs. STOC 1989: 587-598
- 1988
- [c3]Jeff Kahn, Gil Kalai, Nathan Linial: The Influence of Variables on Boolean Functions (Extended Abstract). FOCS 1988: 68-80
- 1987
- [j13]
- [j12]Jeff Kahn, Michael E. Saks: On the widths of finite distributive lattices. Discrete Mathematics 63(2-3): 183-195 (1987)
- [j11]Noga Alon, Jeff Kahn, Paul D. Seymour: Large induced degenerate subgraphs. Graphs and Combinatorics 3(1): 203-211 (1987)
- 1986
- [j10]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski: Addendum to the paper "On the dependence of functions on their variables". J. Comb. Theory, Ser. A 42(2): 317 (1986)
- 1985
- [j9]
- 1984
- [j8]Jeff Kahn, Michael E. Saks: A polyomino with no stochastic function. Combinatorica 4(2): 181-182 (1984)
- [j7]Jeff Kahn, Michael E. Saks, Dean Sturtevant: A topological approach to evasiveness. Combinatorica 4(4): 297-306 (1984)
- [j6]Jeff Kahn: A Geometric Approach to Forbidden Minors for GF(3). J. Comb. Theory, Ser. A 37(1): 1-12 (1984)
- [j5]Jeff Kahn: A family of perfect graphs associated with directed graphs. J. Comb. Theory, Ser. B 37(3): 279-282 (1984)
- [c2]
- 1983
- [c1]Jeff Kahn, Michael E. Saks, Dean Sturtevant: A Topological Approach to Evasiveness. FOCS 1983: 31-33
- 1982
- [j4]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski: On the Dependence of Functions on Their Variables. J. Comb. Theory, Ser. A 33(1): 106-108 (1982)
- 1981
- [j3]
- 1980
- [j2]Ram Prakash Gupta, Jeff Kahn, Neil Robertson: On the maximum number of diagonals of a circuit in a graph. Discrete Mathematics 32(1): 37-43 (1980)
- [j1]Jeff Kahn: Inversive Planes Satisfying the Bundle Theorem. J. Comb. Theory, Ser. A 29(1): 1-19 (1980)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-08 02:31 CEST by the dblp team