Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Liviu Ilinca
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Asymptotics of the Upper Matching Conjecture
2013
Liviu Ilinca
J. Kahn
+
Asymptotics of the Upper Matching Conjecture
2012
Liviu Ilinca
Jeff Kahn
+
The number of 3-SAT functions
2012
Liviu Ilinca
J. Kahn
+
PDF
Chat
Counting Maximal Antichains and Independent Sets
2012
Liviu Ilinca
J. Kahn
+
Counting maximal antichains and independent sets
2012
Liviu Ilinca
Jeff Kahn
+
Asymptotics of the Upper Matching Conjecture
2012
Liviu Ilinca
Jeff Kahn
+
Counting maximal antichains and independent sets
2012
Liviu Ilinca
Jeff Kahn
+
The number of 3-SAT functions
2010
Liviu Ilinca
Jeff Kahn
+
ASYMPTOTIC ENUMERATION OF 2- AND 3-SAT FUNCTIONS
2010
Liviu Ilinca
+
The number of 3-SAT functions
2010
Liviu Ilinca
Jeff Kahn
+
PDF
Chat
On the Number of 2-SAT Functions
2009
Liviu Ilinca
J. Kahn
Common Coauthors
Coauthor
Papers Together
Jeff Kahn
6
J. Kahn
2
J. Kahn
1
J. Kahn
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Some intersection theorems for ordered sets and graphs
1986
Fan Chung
Ronald Graham
Péter Frankl
James B. Shearer
6
+
PDF
Chat
Almost every 2-SAT function is unate
2007
Peter Allen
4
+
PDF
Chat
On the Number of 2-SAT Functions
2009
Liviu Ilinca
J. Kahn
4
+
On the degrees of the vertices of a directed graph
1965
S. L. Hakimi
4
+
Extremal problems on set systems
2002
Péter Frankl
Vojtěch Rödl
3
+
A note on triangle-free and bipartite graphs
2002
Hans Jürgen Prömel
Thomas Schickinger
Angelika Steger
3
+
REGULAR PARTITIONS OF GRAPHS
1975
Endre Szemerédi
3
+
Regularity Lemma for k‐uniform hypergraphs
2004
Vojtěch Rödl
Jozef Skokan
3
+
Szemeredi''s Regularity Lemma and its applications in graph theory
1995
János Komlós
Miklós Simonovits
3
+
PDF
Chat
A short proof of Minc's conjecture
1978
Alexander Schrijver
2
+
Combinatorial Matrix Functions and 1-Factors of Graphs
1970
Peter M. Gibson
2
+
An Entropy Proof of Bregman's Theorem
1997
Jaikumar Radhakrishnan
2
+
Matchings and independent sets of a fixed size in regular graphs
2009
Teena Carroll
David Galvin
Prasad Tetali
2
+
Combinatorics of Finite Sets.
1989
Daniel J. Kleitman
Ian Anderson
2
+
PDF
Chat
On the Validations of the Asymptotic Matching Conjectures
2008
Shmuel Friedland
Elliot Krop
P. H. Lundow
Klas Markström
2
+
An upper bound for the number of perfect matchings in graphs
2008
Shmuel Friedland
2
+
PDF
Chat
Hypergraph regularity and the multidimensional Szemerédi theorem
2007
William Timothy Gowers
2
+
Maximal independent sets in the covering graph of the cube
2010
Dwight Duffus
Péter Frankl
Vojtěch Rödl
2
+
Hypergraph regularity and the multidimensional Szemerédi theorem
2007
W. T. Gowers
2
+
On cliques in graphs
1965
J. W. Moon
Leo Moser
2
+
PDF
Chat
The Number of Independent Sets in a Regular Graph
2009
Yufei Zhao
2
+
Asymptotic enumeration of partial orders on a finite set
1975
Daniel J. Kleitman
Bruce Rothschild
2
+
The Number of Maximal Independent Sets in Triangle-Free Graphs
1993
Mihály Hujtera
Źsolt Tuza
2
+
Asymptotic Enumeration of Partial Orders on a Finite Set
1975
D. J. Kleitman
Bruce Rothschild
1
+
The number of independent sets in graphs
2007
А. А. Сапоженко
1
+
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
2001
Jeff Kahn
1
+
Entropy bounds for perfect matchings and Hamiltonian cycles
2009
Bill Cuckler
Jeff Kahn
1
+
An inequality for permanent of (0, 1)-matrices
1967
Henryk Minc
1
+
An upper bound for the number of independent sets in regular graphs
2009
David Galvin
1
+
PDF
Chat
The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence
2008
Noga Alon
Shmuel Friedland
1
+
PDF
Chat
On the Number of Matchings in Regular Graphs
2008
Shmuel Friedland
Elliot Krop
Klas Markström
1
+
Extremal problems on set systems
2002
Péter Frankl
Vojtěch Rödl
1
+
The maximum number of perfect matchings in graphs with a given degree sequence
2008
Noga Alon
Shmuel Friedland
1
+
PDF
Chat
An Entropy Proof of the Kahn-Lovász Theorem
2011
Jonathan Cutler
A. J. Radcliffe
1