default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeff Kahn 0001
Person information
- affiliation: Rutgers University, Department of Mathematics, Piscataway, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j77]Jean Bourgain, Jeff Kahn, Gil Kalai:
Influential Coalitions for Boolean Functions I: Constructions. Theory Comput. 20: 1-13 (2024)- 2022
- [j76]Jeff Kahn, Jinyoung Park
:
The Number of Maximal Independent Sets in the Hamming Cube. Comb. 42(6): 853-880 (2022) - [j75]Jeff D. Kahn, Jinyoung Park:
Tuza's conjecture for random graphs. Random Struct. Algorithms 61(2): 235-249 (2022) - [j74]Keith Frankston, Jeff Kahn, Jinyoung Park:
On a problem of M. Talagrand. Random Struct. Algorithms 61(4): 710-723 (2022) - 2021
- [j73]Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl:
On symmetric intersecting families of vectors. Comb. Probab. Comput. 30(6): 899-904 (2021) - 2020
- [j72]Jeff Kahn, Jinyoung Park:
Stability for Maximal Independent Sets. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j71]Arran Hamm, Jeff Kahn:
On Erdős-Ko-Rado for Random Hypergraphs II. Comb. Probab. Comput. 28(1): 61-80 (2019) - [j70]Arran Hamm, Jeff Kahn:
On Erdős-Ko-Rado for random hypergraphs I. Comb. Probab. Comput. 28(6): 881-916 (2019) - [j69]Hüseyin Acan, Pat Devlin, Jeff Kahn:
Proof of an entropy conjecture of Leighton and Moitra. J. Comb. Theory A 161: 299-308 (2019) - [j68]Jacob D. Baron, Jeff Kahn:
On the cycle space of a random graph. Random Struct. Algorithms 54(1): 39-68 (2019) - [j67]Hüseyin Acan, Jeff Kahn:
Disproof of a packing conjecture of Alon and Spencer. Random Struct. Algorithms 55(3): 531-544 (2019) - [i4]Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park:
Thresholds versus fractional expectation-thresholds. CoRR abs/1910.13433 (2019) - 2018
- [j66]Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller:
Chvátal's conjecture and correlation inequalities. J. Comb. Theory A 156: 22-43 (2018) - 2017
- [j65]Pat Devlin, Jeff Kahn:
Perfect Fractional Matchings in $k$-Out Hypergraphs. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j64]Jacob D. Baron, Jeff Kahn:
Tuza's Conjecture is Asymptotically Tight for Dense Graphs. Comb. Probab. Comput. 25(5): 645-667 (2016) - [j63]Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald:
The threshold for combs in random graphs. Random Struct. Algorithms 48(4): 794-802 (2016) - [j62]Pat Devlin, Jeff Kahn:
On "stability" in the Erdös-Ko-Rado Theorem. SIAM J. Discret. Math. 30(2): 1283-1289 (2016) - 2015
- [j61]Bobby DeMarco, Jeff Kahn, Amanda Redlich:
Modular Statistics for Subgraph Counts in Sparse Random Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j60]Ehud Friedgut, Jeff Kahn, Clara Shikhelman:
Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms. Electron. J. Comb. 22(2): 2 (2015) - [j59]Bobby DeMarco, Jeff Kahn:
Mantel's theorem for random graphs. Random Struct. Algorithms 47(1): 59-72 (2015) - [j58]Bobby DeMarco, Jeff Kahn:
Note on a problem of M. Talagrand. Random Struct. Algorithms 47(4): 663-668 (2015) - [j57]David J. Galvin, Jeff Kahn, Dana Randall, Gregory B. Sorkin:
Phase coexistence and torpid mixing in the 3-coloring model on ℤd. SIAM J. Discret. Math. 29(3): 1223-1244 (2015) - 2013
- [j56]Arnab Bhattacharyya, Jeff Kahn:
A Bipartite Graph with Non-Unimodal Independent Set Sequence. Electron. J. Comb. 20(4): 11 (2013) - [j55]L. Ilinca, Jeff Kahn:
Asymptotics of the Upper Matching Conjecture. J. Comb. Theory A 120(5): 976-983 (2013) - [j54]L. Ilinca, Jeff Kahn:
Counting Maximal Antichains and Independent Sets. Order 30(2): 427-435 (2013) - [j53]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) - [p1]Jeff Kahn:
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings. The Mathematics of Paul Erdős I 2013: 343-369 - [i3]Arnab Bhattacharyya, Jeff Kahn:
A bipartite graph with non-unimodal independent set sequence. CoRR abs/1301.1752 (2013) - [i2]Jeff Kahn, Gil Kalai:
Functions without influential coalitions. CoRR abs/1308.2794 (2013) - 2012
- [j52]Bobby DeMarco, Jeff Kahn:
Upper tails for triangles. Random Struct. Algorithms 40(4): 452-459 (2012) - [j51]Jeff Kahn, M. Neiman:
Conditional negative association for competing urns. Random Struct. Algorithms 41(2): 262-281 (2012) - [j50]Bobby DeMarco, Jeff Kahn:
Tight upper tail bounds for cliques. Random Struct. Algorithms 41(4): 469-487 (2012) - [i1]Bobby DeMarco, Jeff Kahn:
Mantel's Theorem for random graphs. CoRR abs/1206.1016 (2012) - 2011
- [j49]Jeff Kahn, Michael E. Saks, Clifford D. Smyth:
The Dual BKR Inequality and Rudich's Conjecture. Comb. Probab. Comput. 20(2): 257-266 (2011) - [j48]Jeff Kahn, M. Neiman:
A strong log-concavity property for measures on Boolean algebras. J. Comb. Theory A 118(6): 1749-1760 (2011) - 2010
- [j47]Jeff Kahn, M. Neiman:
Negative correlation and log-concavity. Random Struct. Algorithms 37(3): 367-388 (2010)
2000 – 2009
- 2009
- [j46]Bill Cuckler, Jeff Kahn:
Hamiltonian cycles in Dirac graphs. Comb. 29(3): 299-326 (2009) - [j45]Bill Cuckler, Jeff Kahn:
Entropy bounds for perfect matchings and Hamiltonian cycles. Comb. 29(3): 327-335 (2009) - [j44]L. Ilinca, Jeff Kahn:
On the Number of 2-SAT Functions. Comb. Probab. Comput. 18(5): 749-764 (2009) - 2008
- [j43]Anders Johansson, Jeff Kahn, Van H. Vu:
Factors in random graphs. Random Struct. Algorithms 33(1): 1-28 (2008) - 2007
- [j42]Jeff Kahn, Gil Kalai:
Thresholds and Expectation Thresholds. Comb. Probab. Comput. 16(3): 495-502 (2007) - 2006
- [j41]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
- [j40]David J. Galvin, Jeff Kahn:
On Phase Transition in the Hard-Core Model on Math. Comb. Probab. Comput. 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
- [j39]Jeff Kahn, János Komlós:
Singularity Probabilities For Random Matrices Over Finite Fields. Comb. Probab. Comput. 10(2): 137-157 (2001) - [j38]Jeff Kahn:
An Entropy Approach to the Hard-Core Model on Bipartite Graphs. Comb. Probab. Comput. 10(3): 219-237 (2001) - 2000
- [j37]Jeff Kahn:
A Normal Law for Matchings. Comb. 20(3): 339-391 (2000) - [j36]Jeff Kahn:
Asymptotics of the list-chromatic index for multigraphs. Random Struct. Algorithms 17(2): 117-156 (2000) - [c7]Jeff Kahn, Michael E. Saks, Cliff Smyth:
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. CCC 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
- [j35]Jeff Kahn, Alexander Lawrenz:
Generalized Rank Functions and an Entropy Argument. J. Comb. Theory A 87(2): 398-403 (1999) - 1998
- [j34]Jeff Kahn, Yang Yu:
Log-Concave Functions And Poset Probabilities. Comb. 18(1): 85-99 (1998) - [j33]Jeff Kahn, Jeong Han Kim:
Random Matchings in Regular Graphs. Comb. 18(2): 201-226 (1998) - 1997
- [j32]Jeff Kahn, P. Mark Kayll:
On the Stochastic Independence Properties of Hard-Core Distributions. Comb. 17(3): 369-391 (1997) - [j31]Jeff Kahn, P. Mark Kayll:
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size. J. Comb. Theory A 78(2): 199-235 (1997) - 1996
- [j30]Jeff Kahn, Nathan Linial, Alex Samorodnitsky:
Inclusion-Exclusion: Exact and Approximate. Comb. 16(4): 465-477 (1996) - [j29]Jeff Kahn:
Asymptotics of the Chromatic Index for Multigraphs. J. Comb. Theory, Ser. B 68(2): 233-254 (1996) - [j28]Jeff Kahn:
Asymptotically Good List-Colorings. J. Comb. Theory A 73(1): 1-59 (1996) - [j27]Jeff Kahn:
A linear programming perspective on the Frankl - Rödl - Pippenger theorem. Random Struct. Algorithms 8(2): 149-157 (1996) - 1995
- [j26]Jeff Kahn, Jeong Han Kim:
Entropy and Sorting. J. Comput. Syst. Sci. 51(3): 390-399 (1995) - 1994
- [j25]Jeff Kahn, Gil Kalai:
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs. J. Comb. Theory A 68(2): 317-339 (1994) - 1993
- [j24]Zoltán Füredi, Jeff Kahn, Paul D. Seymour:
On the fractional matching polytope of a hypergraph. Comb. 13(2): 167-180 (1993) - 1992
- [j23]Jeff Kahn, Paul D. Seymour:
A fractional version of the Erdös-Faber-Lovász conjecture. Comb. 12(2): 155-160 (1992) - [j22]Jeff Kahn:
On a problem of Erdös and Lovász: random lines in a projective plane. Comb. 12(4): 417-423 (1992) - [j21]Jeff Kahn:
Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors. J. Comb. Theory A 59(1): 31-39 (1992) - [c5]Jeff Kahn, Jeong Han Kim:
Entropy and Sorting. STOC 1992: 178-187 - 1991
- [j20]Jeff Kahn, Roy Meshulam:
On mod p transversals. Comb. 11(1): 17-22 (1991) - [j19]Jeff Kahn, Nathan Linial:
Balancing extensions via Brunn-Minkowski. Comb. 11(4): 363-368 (1991) - 1990
- [j18]Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers. Discret. Math. 83(1): 129-134 (1990)
1980 – 1989
- 1989
- [j17]Endre Boros, Zoltán Füredi, Jeff Kahn:
Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory A 52(1): 1-9 (1989) - [j16]Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen:
Single-Suit Two-Person Card Play III. The Misère Game. SIAM J. Discret. 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
- [j15]Jeff Kahn:
On Lattices with Möbius Function ±1, 0. Discret. Comput. Geom. 2: 1-8 (1987) - [j14]Jeff Kahn, Michael E. Saks:
On the widths of finite distributive lattices. Discret. Math. 63(2-3): 183-195 (1987) - [j13]Noga Alon, Jeff Kahn, Paul D. Seymour:
Large induced degenerate subgraphs. Graphs Comb. 3(1): 203-211 (1987) - 1986
- [j12]Jeff Kahn, Joseph P. S. Kung:
A Classification of Modularly Complemented Geometric Lattices. Eur. J. Comb. 7(3): 243-248 (1986) - [j11]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski:
Addendum to the paper "On the dependence of functions on their variables". J. Comb. Theory A 42(2): 317 (1986) - 1985
- [j10]Jeff Kahn:
A problem of P. Seymour on nonbinary matroids. Comb. 5(4): 319-323 (1985) - 1984
- [j9]Jeff Kahn, Michael E. Saks:
A polyomino with no stochastic function. Comb. 4(2): 181-182 (1984) - [j8]Jeff Kahn, Michael E. Saks, Dean Sturtevant:
A topological approach to evasiveness. Comb. 4(4): 297-306 (1984) - [j7]Jeff Kahn:
A Geometric Approach to Forbidden Minors for GF(3). J. Comb. Theory A 37(1): 1-12 (1984) - [j6]Jeff Kahn:
A family of perfect graphs associated with directed graphs. J. Comb. Theory B 37(3): 279-282 (1984) - [c2]Jeff Kahn, Michael E. Saks:
Every Poset Has a Good Comparison. STOC 1984: 299-301 - 1983
- [c1]Jeff Kahn, Michael E. Saks, Dean Sturtevant:
A Topological Approach to Evasiveness. FOCS 1983: 31-33 - 1982
- [j5]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski:
On the Dependence of Functions on Their Variables. J. Comb. Theory A 33(1): 106-108 (1982) - 1981
- [j4]Jeff Kahn, Daniel J. Kleitman:
On cross-bandwidth. Discret. Math. 33(3): 323-325 (1981) - [j3]Eiichi Bannai, Peter J. Cameron, Jeff Kahn:
Nonexistence of certain distance-transitive digraphs. J. Comb. Theory B 31(3): 105-110 (1981) - 1980
- [j2]Ram Prakash Gupta, Jeff Kahn, Neil Robertson:
On the maximum number of diagonals of a circuit in a graph. Discret. Math. 32(1): 37-43 (1980) - [j1]Jeff Kahn:
Inversive Planes Satisfying the Bundle Theorem. J. Comb. Theory A 29(1): 1-19 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
