Jeff Kahn

According to our database, Jeff Kahn authored at least 86 papers between 1980 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Influential Coalitions for Boolean Functions I: Constructions.

Jean Bourgain, Jeff Kahn, Gil Kalai

Theory Comput., 2024

2022

Tuza's conjecture for random graphs.

Jeff D. Kahn, Jinyoung Park

Random Struct. Algorithms, 2022

On a problem of M. Talagrand.

Keith Frankston, Jeff Kahn, Jinyoung Park

Random Struct. Algorithms, 2022

The Number of Maximal Independent Sets in the Hamming Cube.

Jeff Kahn, Jinyoung Park

Comb., 2022

2021

On symmetric intersecting families of vectors.

Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl

Comb. Probab. Comput., 2021

2020

Stability for Maximal Independent Sets.

Jeff Kahn, Jinyoung Park

Electron. J. Comb., 2020

2019

On the cycle space of a random graph.

Jacob D. Baron, Jeff Kahn

Random Struct. Algorithms, 2019

Disproof of a packing conjecture of Alon and Spencer.

Hüseyin Acan, Jeff Kahn

Random Struct. Algorithms, 2019

Proof of an entropy conjecture of Leighton and Moitra.

Hüseyin Acan, Pat Devlin, Jeff Kahn

J. Comb. Theory A, 2019

On Erdős-Ko-Rado for random hypergraphs I.

Arran Hamm, Jeff Kahn

Comb. Probab. Comput., 2019

On Erdős-Ko-Rado for Random Hypergraphs II.

Arran Hamm, Jeff Kahn

Comb. Probab. Comput., 2019

Thresholds versus fractional expectation-thresholds.

Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park

CoRR, 2019

2018

Chvátal's conjecture and correlation inequalities.

Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller

J. Comb. Theory A, 2018

2017

Perfect Fractional Matchings in $k$-Out Hypergraphs.

Pat Devlin, Jeff Kahn

Electron. J. Comb., 2017

2016

On "stability" in the Erdös-Ko-Rado Theorem.

Pat Devlin, Jeff Kahn

SIAM J. Discret. Math., 2016

The threshold for combs in random graphs.

Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald

Random Struct. Algorithms, 2016

Tuza's Conjecture is Asymptotically Tight for Dense Graphs.

Jacob D. Baron, Jeff Kahn

Comb. Probab. Comput., 2016

2015

Phase coexistence and torpid mixing in the 3-coloring model on ℤ^d.

David J. Galvin, Jeff Kahn, Dana Randall, Gregory B. Sorkin

SIAM J. Discret. Math., 2015

Note on a problem of M. Talagrand.

Bobby DeMarco, Jeff Kahn

Random Struct. Algorithms, 2015

Mantel's theorem for random graphs.

Bobby DeMarco, Jeff Kahn

Random Struct. Algorithms, 2015

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms.

Ehud Friedgut, Jeff Kahn, Clara Shikhelman

Electron. J. Comb., 2015

Modular Statistics for Subgraph Counts in Sparse Random Graphs.

Bobby DeMarco, Jeff Kahn, Amanda Redlich

Electron. J. Comb., 2015

2013

Left and right convergence of graphs with bounded degree.

Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász

Random Struct. Algorithms, 2013

Counting Maximal Antichains and Independent Sets.

L. Ilinca, Jeff Kahn

Order, 2013

Asymptotics of the Upper Matching Conjecture.

L. Ilinca, Jeff Kahn

J. Comb. Theory A, 2013

Functions without influential coalitions.

Jeff Kahn, Gil Kalai

CoRR, 2013

A Bipartite Graph with Non-Unimodal Independent Set Sequence.

Arnab Bhattacharyya, Jeff Kahn

Electron. J. Comb., 2013

On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings.

Jeff Kahn

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

Conditional negative association for competing urns.

Jeff Kahn, M. Neiman

Random Struct. Algorithms, 2012

Tight upper tail bounds for cliques.

Bobby DeMarco, Jeff Kahn

Random Struct. Algorithms, 2012

Upper tails for triangles.

Bobby DeMarco, Jeff Kahn

Random Struct. Algorithms, 2012

2011

A strong log-concavity property for measures on Boolean algebras.

Jeff Kahn, M. Neiman

J. Comb. Theory A, 2011

The Dual BKR Inequality and Rudich's Conjecture.

Jeff Kahn, Michael E. Saks, Clifford D. Smyth

Comb. Probab. Comput., 2011

2010

Negative correlation and log-concavity.

Jeff Kahn, M. Neiman

Random Struct. Algorithms, 2010

2009

On the Number of 2-SAT Functions.

L. Ilinca, Jeff Kahn

Comb. Probab. Comput., 2009

Entropy bounds for perfect matchings and Hamiltonian cycles.

Bill Cuckler, Jeff Kahn

Comb., 2009

Hamiltonian cycles in Dirac graphs.

Bill Cuckler, Jeff Kahn

Comb., 2009

2008

Factors in random graphs.

Anders Johansson, Jeff Kahn, Van H. Vu

Random Struct. Algorithms, 2008

2007

Thresholds and Expectation Thresholds.

Jeff Kahn, Gil Kalai

Comb. Probab. Comput., 2007

2006

Some conditional correlation inequalities for percolation and related processes.

Jacob van den Berg, Olle Häggström, Jeff Kahn

Random Struct. Algorithms, 2006

2004

On Phase Transition in the Hard-Core Model on Math.

David J. Galvin, Jeff Kahn

Comb. Probab. Comput., 2004

2002

Computing Graph Properties by Randomized Subcube Partitions.

Ehud Friedgut, Jeff Kahn, Avi Wigderson

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001

Singularity Probabilities For Random Matrices Over Finite Fields.

Jeff Kahn, János Komlós

Comb. Probab. Comput., 2001

An Entropy Approach to the Hard-Core Model on Bipartite Graphs.

Jeff Kahn

Comb. Probab. Comput., 2001

2000

Asymptotics of the list-chromatic index for multigraphs.

Jeff Kahn

Random Struct. Algorithms, 2000

A Normal Law for Matchings.

Jeff Kahn

Comb., 2000

The Cover Time, the Blanket Time, and the Matthews Bound.

Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.

Jeff Kahn, Michael E. Saks, Cliff Smyth

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Generalized Rank Functions and an Entropy Argument.

Jeff Kahn, Alexander Lawrenz

J. Comb. Theory A, 1999

1998

Log-Concave Functions And Poset Probabilities.

Jeff Kahn, Yang Yu

Comb., 1998

Random Matchings in Regular Graphs.

Jeff Kahn, Jeong Han Kim

Comb., 1998

1997

Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.

Jeff Kahn, P. Mark Kayll

J. Comb. Theory A, 1997

On the Stochastic Independence Properties of Hard-Core Distributions.

Jeff Kahn, P. Mark Kayll

Comb., 1997

1996

A linear programming perspective on the Frankl - Rödl - Pippenger theorem.

Jeff Kahn

Random Struct. Algorithms, 1996

Asymptotics of the Chromatic Index for Multigraphs.

Jeff Kahn

J. Comb. Theory, Ser. B, 1996

Asymptotically Good List-Colorings.

Jeff Kahn

J. Comb. Theory A, 1996

Inclusion-Exclusion: Exact and Approximate.

Jeff Kahn, Nathan Linial, Alex Samorodnitsky

Comb., 1996

1994

A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.

Jeff Kahn, Gil Kalai

J. Comb. Theory A, 1994

1993

On the fractional matching polytope of a hypergraph.

Zoltán Füredi, Jeff Kahn, Paul D. Seymour

Comb., 1993

1992

Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors.

Jeff Kahn

J. Comb. Theory A, 1992

A fractional version of the Erdös-Faber-Lovász conjecture.

Jeff Kahn, Paul D. Seymour

Comb., 1992

On a problem of Erdös and Lovász: random lines in a projective plane.

Jeff Kahn

Comb., 1992

Entropy and Sorting

Jeff Kahn, Jeong Han Kim

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

On mod p transversals.

Jeff Kahn, Roy Meshulam

Comb., 1991

Balancing extensions via Brunn-Minkowski.

Jeff Kahn, Nathan Linial

Comb., 1991

1990

Sphere coverings of the hypercube with incomparable centers.

Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman

Discret. Math., 1990

1989

Single-Suit Two-Person Card Play III. The Misère Game.

Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen

SIAM J. Discret. Math., 1989

Maximal intersecting families and affine regular polygons in <i>PG</i>(2, <i>q</i>).

Endre Boros, Zoltán Füredi, Jeff Kahn

J. Comb. Theory A, 1989

On the Second Eigenvalue in Random Regular Graphs

Joel Friedman, Jeff Kahn, Endre Szemerédi

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

The Influence of Variables on Boolean Functions (Extended Abstract)

Jeff Kahn, Gil Kalai, Nathan Linial

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Large induced degenerate subgraphs.

Noga Alon, Jeff Kahn, Paul D. Seymour

Graphs Comb., 1987

On the widths of finite distributive lattices.

Jeff Kahn, Michael E. Saks

Discret. Math., 1987

On Lattices with Möbius Function ±1, 0.

Jeff Kahn

Discret. Comput. Geom., 1987

1986

Addendum to the paper "On the dependence of functions on their variables".

Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski

J. Comb. Theory A, 1986

A Classification of Modularly Complemented Geometric Lattices.

Jeff Kahn, Joseph P. S. Kung

Eur. J. Comb., 1986

1985

A problem of P. Seymour on nonbinary matroids.

Jeff Kahn

Comb., 1985

1984

A family of perfect graphs associated with directed graphs.

Jeff Kahn

J. Comb. Theory B, 1984

A Geometric Approach to Forbidden Minors for GF(3).

Jeff Kahn

J. Comb. Theory A, 1984

A polyomino with no stochastic function.

Jeff Kahn, Michael E. Saks

Comb., 1984

Every Poset Has a Good Comparison

Jeff Kahn, Michael E. Saks

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

A Topological Approach to Evasiveness

Jeff Kahn, Michael E. Saks, Dean Sturtevant

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

On the Dependence of Functions on Their Variables.

Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski

J. Comb. Theory A, 1982

1981

Nonexistence of certain distance-transitive digraphs.

Eiichi Bannai, Peter J. Cameron, Jeff Kahn

J. Comb. Theory B, 1981

On cross-bandwidth.

Jeff Kahn, Daniel J. Kleitman

Discret. Math., 1981

1980

Inversive Planes Satisfying the Bundle Theorem.

Jeff Kahn

J. Comb. Theory A, 1980

On the maximum number of diagonals of a circuit in a graph.

Ram Prakash Gupta, Jeff Kahn, Neil Robertson

Discret. Math., 1980