Jeff Kahn

According to our database1, Jeff Kahn authored at least 76 papers between 1980 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





On the cycle space of a random graph.
Random Struct. Algorithms, 2019

Proof of an entropy conjecture of Leighton and Moitra.
J. Comb. Theory, Ser. A, 2019

On Erdős-Ko-Rado for Random Hypergraphs II.
Combinatorics, Probability & Computing, 2019

Chvátal's conjecture and correlation inequalities.
J. Comb. Theory, Ser. A, 2018

Perfect Fractional Matchings in $k$-Out Hypergraphs.
Electr. J. Comb., 2017

On "stability" in the Erdös-Ko-Rado Theorem.
SIAM J. Discrete Math., 2016

The threshold for combs in random graphs.
Random Struct. Algorithms, 2016

Tuza's Conjecture is Asymptotically Tight for Dense Graphs.
Combinatorics, Probability & Computing, 2016

Phase coexistence and torpid mixing in the 3-coloring model on ℤd.
SIAM J. Discrete Math., 2015

Note on a problem of M. Talagrand.
Random Struct. Algorithms, 2015

Mantel's theorem for random graphs.
Random Struct. Algorithms, 2015

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms.
Electr. J. Comb., 2015

Modular Statistics for Subgraph Counts in Sparse Random Graphs.
Electr. J. Comb., 2015

Left and right convergence of graphs with bounded degree.
Random Struct. Algorithms, 2013

Counting Maximal Antichains and Independent Sets.
Order, 2013

Asymptotics of the Upper Matching Conjecture.
J. Comb. Theory, Ser. A, 2013

A Bipartite Graph with Non-Unimodal Independent Set Sequence.
Electr. J. Comb., 2013

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

Conditional negative association for competing urns.
Random Struct. Algorithms, 2012

Tight upper tail bounds for cliques.
Random Struct. Algorithms, 2012

Upper tails for triangles.
Random Struct. Algorithms, 2012

A strong log-concavity property for measures on Boolean algebras.
J. Comb. Theory, Ser. A, 2011

The Dual BKR Inequality and Rudich's Conjecture.
Combinatorics, Probability & Computing, 2011

Negative correlation and log-concavity.
Random Struct. Algorithms, 2010

On the Number of 2-SAT Functions.
Combinatorics, Probability & Computing, 2009

Entropy bounds for perfect matchings and Hamiltonian cycles.
Combinatorica, 2009

Hamiltonian cycles in Dirac graphs.
Combinatorica, 2009

Factors in random graphs.
Random Struct. Algorithms, 2008

Thresholds and Expectation Thresholds.
Combinatorics, Probability & Computing, 2007

Some conditional correlation inequalities for percolation and related processes.
Random Struct. Algorithms, 2006

On Phase Transition in the Hard-Core Model on Math.
Combinatorics, Probability & Computing, 2004

Computing Graph Properties by Randomized Subcube Partitions.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Singularity Probabilities For Random Matrices Over Finite Fields.
Combinatorics, Probability & Computing, 2001

Asymptotics of the list-chromatic index for multigraphs.
Random Struct. Algorithms, 2000

A Normal Law for Matchings.
Combinatorica, 2000

The Cover Time, the Blanket Time, and the Matthews Bound.
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.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

Generalized Rank Functions and an Entropy Argument.
J. Comb. Theory, Ser. A, 1999

Log-Concave Functions And Poset Probabilities.
Combinatorica, 1998

Random Matchings in Regular Graphs.
Combinatorica, 1998

Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.
J. Comb. Theory, Ser. A, 1997

On the Stochastic Independence Properties of Hard-Core Distributions.
Combinatorica, 1997

A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
Random Struct. Algorithms, 1996

Asymptotics of the Chromatic Index for Multigraphs.
J. Comb. Theory, Ser. B, 1996

Asymptotically Good List-Colorings.
J. Comb. Theory, Ser. A, 1996

Inclusion-Exclusion: Exact and Approximate.
Combinatorica, 1996

Entropy and Sorting.
J. Comput. Syst. Sci., 1995

A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.
J. Comb. Theory, Ser. A, 1994

On the fractional matching polytope of a hypergraph.
Combinatorica, 1993

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

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

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

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

On mod p transversals.
Combinatorica, 1991

Balancing extensions via Brunn-Minkowski.
Combinatorica, 1991

Sphere coverings of the hypercube with incomparable centers.
Discrete Mathematics, 1990

Single-Suit Two-Person Card Play III. The Misère Game.
SIAM J. Discrete Math., 1989

Maximal intersecting families and affine regular polygons in PG(2, q).
J. Comb. Theory, Ser. A, 1989

On the Second Eigenvalue in Random Regular Graphs
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Influence of Variables on Boolean Functions (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Large induced degenerate subgraphs.
Graphs and Combinatorics, 1987

On the widths of finite distributive lattices.
Discrete Mathematics, 1987

On Lattices with Möbius Function ±1, 0.
Discrete & Computational Geometry, 1987

Addendum to the paper "On the dependence of functions on their variables".
J. Comb. Theory, Ser. A, 1986

A Classification of Modularly Complemented Geometric Lattices.
Eur. J. Comb., 1986

A problem of P. Seymour on nonbinary matroids.
Combinatorica, 1985

A family of perfect graphs associated with directed graphs.
J. Comb. Theory, Ser. B, 1984

A Geometric Approach to Forbidden Minors for GF(3).
J. Comb. Theory, Ser. A, 1984

A topological approach to evasiveness.
Combinatorica, 1984

A polyomino with no stochastic function.
Combinatorica, 1984

Every Poset Has a Good Comparison
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A Topological Approach to Evasiveness
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

On the Dependence of Functions on Their Variables.
J. Comb. Theory, Ser. A, 1982

On cross-bandwidth.
Discrete Mathematics, 1981

Inversive Planes Satisfying the Bundle Theorem.
J. Comb. Theory, Ser. A, 1980

On the maximum number of diagonals of a circuit in a graph.
Discrete Mathematics, 1980