On the maximum number of diagonals of a circuit in a graph. - Ram Prakash Gupta; Jeff Kahn 001; Neil Robertson 001 (Discret. Math., 1980)

Inversive Planes Satisfying the Bundle Theorem. - Jeff Kahn 001 (J. Comb. Theory A, 1980)

On cross-bandwidth. - Jeff Kahn 001; Daniel J. Kleitman (Discret. Math., 1981)

Nonexistence of certain distance-transitive digraphs. - Eiichi Bannai; Peter J. Cameron; Jeff Kahn 001 (J. Comb. Theory B, 1981)

On the Dependence of Functions on Their Variables. - Andrzej Ehrenfeucht; Jeff Kahn 001; Roger D. Maddux; Jan Mycielski (J. Comb. Theory A, 1982)

Every Poset Has a Good Comparison - Jeff Kahn 001; Michael E. Saks (STOC, 1984)

A polyomino with no stochastic function. - Jeff Kahn 001; Michael E. Saks (Comb., 1984)

A topological approach to evasiveness. - Jeff Kahn 001; Michael E. Saks; Dean Sturtevant (Comb., 1984)

A Geometric Approach to Forbidden Minors for GF(3). - Jeff Kahn 001 (J. Comb. Theory A, 1984)

A family of perfect graphs associated with directed graphs. - Jeff Kahn 001 (J. Comb. Theory B, 1984)

A problem of P. Seymour on nonbinary matroids. - Jeff Kahn 001 (Comb., 1985)

A Classification of Modularly Complemented Geometric Lattices. - Jeff Kahn 001; Joseph P. S. Kung (Eur. J. Comb., 1986)

Addendum to the paper "On the dependence of functions on their variables". - Andrzej Ehrenfeucht; Jeff Kahn 001; Roger D. Maddux; Jan Mycielski (J. Comb. Theory A, 1986)

On Lattices with Möbius Function ±1, 0. - Jeff Kahn 001 (Discret. Comput. Geom., 1987)

On the widths of finite distributive lattices. - Jeff Kahn 001; Michael E. Saks (Discret. Math., 1987)

Large induced degenerate subgraphs. - Noga Alon; Jeff Kahn 001; Paul D. Seymour (Graphs Comb., 1987)

The Influence of Variables on Boolean Functions (Extended Abstract) - Jeff Kahn 001; Gil Kalai; Nathan Linial (FOCS, 1988)

On the Second Eigenvalue in Random Regular Graphs - Joel Friedman; Jeff Kahn 001; Endre Szemerédi (STOC, 1989)

Maximal intersecting families and affine regular polygons in PG(2, q). - Endre Boros; Zoltán Füredi; Jeff Kahn 001 (J. Comb. Theory A, 1989)

Single-Suit Two-Person Card Play III. The Misère Game. - Jeff Kahn 001; J. C. Lagarias 001; Hans S. Witsenhausen (SIAM J. Discret. Math., 1989)

Sphere coverings of the hypercube with incomparable centers. - Zoltán Füredi; Jeff Kahn 001; Daniel J. Kleitman (Discret. Math., 1990)

Balancing extensions via Brunn-Minkowski. - Jeff Kahn 001; Nathan Linial (Comb., 1991)

On mod p transversals. - Jeff Kahn 001; Roy Meshulam (Comb., 1991)

On a problem of Erdös and Lovász: random lines in a projective plane. - Jeff Kahn 001 (Comb., 1992)

A fractional version of the Erdös-Faber-Lovász conjecture. - Jeff Kahn 001; Paul D. Seymour (Comb., 1992)

Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors. - Jeff Kahn 001 (J. Comb. Theory A, 1992)

On the fractional matching polytope of a hypergraph. - Zoltán Füredi; Jeff Kahn 001; Paul D. Seymour (Comb., 1993)

A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs. - Jeff Kahn 001; Gil Kalai (J. Comb. Theory A, 1994)

Entropy and Sorting. - Jeff Kahn 001; Jeong Han Kim (J. Comput. Syst. Sci., 1995)

Inclusion-Exclusion: Exact and Approximate. - Jeff Kahn 001; Nathan Linial; Alex Samorodnitsky (Comb., 1996)

Asymptotically Good List-Colorings. - Jeff Kahn 001 (J. Comb. Theory A, 1996)

Asymptotics of the Chromatic Index for Multigraphs. - Jeff Kahn 001 (J. Comb. Theory, Ser. B, 1996)

A linear programming perspective on the Frankl - Rödl - Pippenger theorem. - Jeff Kahn 001 (Random Struct. Algorithms, 1996)

On the Stochastic Independence Properties of Hard-Core Distributions. - Jeff Kahn 001; P. Mark Kayll (Comb., 1997)

Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size. - Jeff Kahn 001; P. Mark Kayll (J. Comb. Theory A, 1997)

Random Matchings in Regular Graphs. - Jeff Kahn 001; Jeong Han Kim (Comb., 1998)

Log-Concave Functions And Poset Probabilities. - Jeff Kahn 001; Yang Yu 025 (Comb., 1998)

Generalized Rank Functions and an Entropy Argument. - Jeff Kahn 001; Alexander Lawrenz (J. Comb. Theory A, 1999)

A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. - Jeff Kahn 001; Michael E. Saks; Cliff Smyth 001 (CCC, 2000)

The Cover Time, the Blanket Time, and the Matthews Bound. - Jeff Kahn 001; Jeong Han Kim; László Lovász 001; Van H. Vu (FOCS, 2000)

A Normal Law for Matchings. - Jeff Kahn 001 (Comb., 2000)

Asymptotics of the list-chromatic index for multigraphs. - Jeff Kahn 001 (Random Struct. Algorithms, 2000)

An Entropy Approach to the Hard-Core Model on Bipartite Graphs. - Jeff Kahn 001 (Comb. Probab. Comput., 2001)

Singularity Probabilities For Random Matrices Over Finite Fields. - Jeff Kahn 001; János Komlós (Comb. Probab. Comput., 2001)

Computing Graph Properties by Randomized Subcube Partitions. - Ehud Friedgut; Jeff Kahn 001; Avi Wigderson (RANDOM, 2002)

On Phase Transition in the Hard-Core Model on Math. - David J. Galvin; Jeff Kahn 001 (Comb. Probab. Comput., 2004)

Some conditional correlation inequalities for percolation and related processes. - Jacob van den Berg; Olle Häggström; Jeff Kahn 001 (Random Struct. Algorithms, 2006)

Thresholds and Expectation Thresholds. - Jeff Kahn 001; Gil Kalai (Comb. Probab. Comput., 2007)

Factors in random graphs. - Anders Johansson; Jeff Kahn 001; Van H. Vu (Random Struct. Algorithms, 2008)

Hamiltonian cycles in Dirac graphs. - Bill Cuckler; Jeff Kahn 001 (Comb., 2009)

Entropy bounds for perfect matchings and Hamiltonian cycles. - Bill Cuckler; Jeff Kahn 001 (Comb., 2009)

On the Number of 2-SAT Functions. - L. Ilinca; Jeff Kahn 001 (Comb. Probab. Comput., 2009)

Negative correlation and log-concavity. - Jeff Kahn 001; M. Neiman (Random Struct. Algorithms, 2010)

The Dual BKR Inequality and Rudich's Conjecture. - Jeff Kahn 001; Michael E. Saks; Clifford D. Smyth (Comb. Probab. Comput., 2011)

A strong log-concavity property for measures on Boolean algebras. - Jeff Kahn 001; M. Neiman (J. Comb. Theory A, 2011)

Upper tails for triangles. - Bobby DeMarco; Jeff Kahn 001 (Random Struct. Algorithms, 2012)

Tight upper tail bounds for cliques. - Bobby DeMarco; Jeff Kahn 001 (Random Struct. Algorithms, 2012)

Conditional negative association for competing urns. - Jeff Kahn 001; M. Neiman (Random Struct. Algorithms, 2012)

On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings. - Jeff Kahn 001 (The Mathematics of Paul Erdős I, 2013)

A Bipartite Graph with Non-Unimodal Independent Set Sequence. - Arnab Bhattacharyya 001; Jeff Kahn 001 (Electron. J. Comb., 2013)

Functions without influential coalitions. - Jeff Kahn 001; Gil Kalai (CoRR, 2013)

Asymptotics of the Upper Matching Conjecture. - L. Ilinca; Jeff Kahn 001 (J. Comb. Theory A, 2013)

Counting Maximal Antichains and Independent Sets. - L. Ilinca; Jeff Kahn 001 (Order, 2013)

Left and right convergence of graphs with bounded degree. - Christian Borgs; Jennifer T. Chayes; Jeff Kahn 001; László Lovász 001 (Random Struct. Algorithms, 2013)

Modular Statistics for Subgraph Counts in Sparse Random Graphs. - Bobby DeMarco; Jeff Kahn 001; Amanda Redlich (Electron. J. Comb., 2015)

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms. - Ehud Friedgut; Jeff Kahn 001; Clara Shikhelman (Electron. J. Comb., 2015)

Mantel's theorem for random graphs. - Bobby DeMarco; Jeff Kahn 001 (Random Struct. Algorithms, 2015)

Note on a problem of M. Talagrand. - Bobby DeMarco; Jeff Kahn 001 (Random Struct. Algorithms, 2015)

Phase coexistence and torpid mixing in the 3-coloring model on ℤd. - David J. Galvin; Jeff Kahn 001; Dana Randall; Gregory B. Sorkin (SIAM J. Discret. Math., 2015)

Tuza's Conjecture is Asymptotically Tight for Dense Graphs. - Jacob D. Baron; Jeff Kahn 001 (Comb. Probab. Comput., 2016)

The threshold for combs in random graphs. - Jeff Kahn 001; Eyal Lubetzky; Nicholas C. Wormald (Random Struct. Algorithms, 2016)

On "stability" in the Erdös-Ko-Rado Theorem. - Pat Devlin 001; Jeff Kahn 001 (SIAM J. Discret. Math., 2016)

Perfect Fractional Matchings in $k$-Out Hypergraphs. - Pat Devlin 001; Jeff Kahn 001 (Electron. J. Comb., 2017)

Chvátal's conjecture and correlation inequalities. - Ehud Friedgut; Jeff Kahn 001; Gil Kalai; Nathan Keller (J. Comb. Theory A, 2018)

Thresholds versus fractional expectation-thresholds. - Keith Frankston; Jeff Kahn 001; Bhargav Narayanan; Jinyoung Park (CoRR, 2019)

On Erdős-Ko-Rado for Random Hypergraphs II. - Arran Hamm; Jeff Kahn 001 (Comb. Probab. Comput., 2019)

On Erdős-Ko-Rado for random hypergraphs I. - Arran Hamm; Jeff Kahn 001 (Comb. Probab. Comput., 2019)

Proof of an entropy conjecture of Leighton and Moitra. - Hüseyin Acan; Pat Devlin 001; Jeff Kahn 001 (J. Comb. Theory A, 2019)

Disproof of a packing conjecture of Alon and Spencer. - Hüseyin Acan; Jeff Kahn 001 (Random Struct. Algorithms, 2019)

On the cycle space of a random graph. - Jacob D. Baron; Jeff Kahn 001 (Random Struct. Algorithms, 2019)

Stability for Maximal Independent Sets. - Jeff Kahn 001; Jinyoung Park (Electron. J. Comb., 2020)

On symmetric intersecting families of vectors. - Sean Eberhard; Jeff Kahn 001; Bhargav Narayanan; Sophie Spirkl (Comb. Probab. Comput., 2021)

The Number of Maximal Independent Sets in the Hamming Cube. - Jeff Kahn 001; Jinyoung Park (Comb., 2022)

On a problem of M. Talagrand. - Keith Frankston; Jeff Kahn 001; Jinyoung Park (Random Struct. Algorithms, 2022)

Tuza's conjecture for random graphs. - Jeff D. Kahn 001; Jinyoung Park (Random Struct. Algorithms, 2022)

Influential Coalitions for Boolean Functions I: Constructions. - Jean Bourgain; Jeff Kahn 001; Gil Kalai (Theory Comput., 2024)