Emanuela Fachini

Generating author description...

All published works

Action	Title	Year	Authors
+	Divergent permutations	2020	Emanuela Fachini János Körner
+	Divergent permutations	2019	Emanuela Fachini János Körner
+ PDF Chat	Interlocked Permutations	2019	Gérard Cohen Emanuela Fachini János Körner
+	Divergent permutations	2019	Emanuela Fachini János Körner
+	Interlocking permutations	2018	Gérard Cohen Emanuela Fachini János Körner
+	Interlocked permutations	2018	Gérard Cohen Emanuela Fachini János Körner
+ PDF Chat	Hamilton Paths With Lasting Separation	2017	Emanuela Fachini János Körner
+ PDF Chat	Path separation by short cycles	2017	Gérard Cohen Emanuela Fachini János Körner
+	Hamilton paths with lasting separation	2017	János Körner Emanuela Fachini
+	Hamilton paths with lasting separation	2017	János Körner Emanuela Fachini
+ PDF Chat	Path Separation by Short Cycles	2016	Gérard Cohen Emanuela Fachini János Körner
+ PDF Chat	Zero-Error Capacity of Binary Channels With Memory	2015	Gérard Cohen Emanuela Fachini János Körner
+	Path separation by short cycles	2015	Gérard Cohen Emanuela Fachini János Körner
+	More on Connector Families	2013	Gérard Cohen Emanuela Fachini János Körner
+ PDF Chat	Connector Families of Graphs	2013	Gérard Cohen Emanuela Fachini János Körner
+	Permutation Capacities and Oriented Infinite Paths	2011	Graham Brightwell Gérard Cohen Emanuela Fachini Marianne Fairthorne János Körner Gábor Simonyi Ágnes Tóth
+	Forbiddance and Capacity	2010	Emanuela Fachini János Körner
+ PDF Chat	Permutation Capacities of Families of Oriented Infinite Paths	2010	Graham Brightwell Gérard Cohen Emanuela Fachini Marianne Fairthorne János Körner Gábor Simonyi Ágnes Tóth
+	Skewincidence	2010	Gérard Cohen Emanuela Fachini János Körner
+	On the permutation capacity of digraphs	2008	Gérard Cohen Emanuela Fachini János Körner
+	Cross‐intersecting couples of graphs	2007	Emanuela Fachini János Körner
+	A Note on Counting Very Different Sequences	2001	Emanuela Fachini János Körner
+	A Better Bound for Locally Thin Set Families	2001	Emanuela Fachini János Körner Angelo Monti
+	Self-Similarity Bounds for Locally Thin Set Families	2001	Emanuela Fachini János Körner Angelo Monti
+	Colour Number, Capacity, and Perfectness of Directed Graphs	2000	Emanuela Fachini János Körner
+ PDF Chat	Locally Thin Set Families	2000	Noga Alon Emanuela Fachini János Körner
+	A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood.	1986	Emanuela Fachini Lorenzo Iania

Common Coauthors

Coauthor	Papers Together
János Körner	26
Gérard Cohen	13
Gábor Simonyi	2
Marianne Fairthorne	2
Angelo Monti	2
Graham Brightwell	2
Ágnes Tóth	2
Noga Alon	1
Lorenzo Iania	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Capacities: From information theory to extremal set theory	1994	Luisa Gargano János Körner Ugo Vaccaro	14
+ PDF Chat	Pairwise colliding permutations and the capacity of infinite graphs	2006	János Körner Claudia Malvenuto	8
+	On the Shannon capacity of a graph	1979	László Lovász	7
+ PDF Chat	Graph-Different Permutations	2008	János Körner Claudia Malvenuto Gábor Simonyi	7
+	Zero-error capacities and very different sequences	1990	Gérard Cohen János Körner Gábor Simonyi	5
+	Qualitative independence and Sperner problems for directed graphs	1992	Luisa Gargano János Körner Ugo Vaccaro	5
+ PDF Chat	Permutation Capacities of Families of Oriented Infinite Paths	2010	Graham Brightwell Gérard Cohen Emanuela Fachini Marianne Fairthorne János Körner Gábor Simonyi Ágnes Tóth	5
+	On types of growth for graph-different permutations	2008	János Körner Gábor Simonyi Blerina Sinaimeri	5
+	Sperner capacities	1993	Luisa Gargano J. K�rner Ugo Vaccaro	5
+	Setwise intersecting families of permutations	2012	David Ellis	4
+	Fredman–Komlós bounds and information theory	1986	Jénos Körner	4
+ PDF Chat	Families of Graph-different Hamilton Paths	2012	János Körner Silvia Messuti Gábor Simonyi	4
+	A sperner-type theorem and qualitative independence	1992	János Körner Gábor Simonyi	4
+ PDF Chat	INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS	1961	Péter L. Erdős Chao Ko R. Rado	3
+ PDF Chat	Triangle-intersecting families of graphs	2012	David Ellis Yuval Filmus Ehud Friedgut	3
+	On Reverse-Free Codes and Permutations	2010	Zoltán Füredi Ida Kantor Angelo Monti Blerina Sinaimeri	3
+	New Bounds for Perfect Hashing via Information Theory	1988	János Körner K. Marton	3
+ PDF Chat	Maximum Size of Reverse-Free Sets of Permutations	2013	Josef Cibulka	3
+	String Quartets in Binary	2000	Noga Alon János Körner Angelo Monti	3
+	Families of locally separated Hamilton paths	2014	János Körner Angelo Monti	3
+	Extremal problems on $-systems	2000	Alexandr Kostochka	2
+	On the Capacity of Digraphs	1998	Noga Alon	2
+	Fractional graph theory	1978	Claude Berge	2
+	Union-free Hypergraphs and Probability Theory	1984	Péter Frankl Zoltan Föredi	2
+	Combinatorial properties of systems of sets	1978	P. Erdős Endre Szemerédi	2
+	On the ratio of optimal integral and fractional covers	1975	László Lovász	2
+ PDF Chat	Degree-Doubling Graph Families	2013	János Körner Irene Muzi	2
+ PDF Chat	None	1993	Aart Blokhuis	2
+	Primary cyclotomic units and a proof of Catalans conjecture	2004	Preda Mihăilescu	2
+ PDF Chat	Locally Thin Set Families	2000	Noga Alon Emanuela Fachini János Körner	2
+ PDF Chat	Path Separation by Short Cycles	2016	Gérard Cohen Emanuela Fachini János Körner	2
+	Determination of two vectors from the sum	1969	Bernt Lindström	2
+ PDF Chat	The Maximum Order of the Group of a Tournament	1967	John D. Dixon	1
+	GRAPHS AND HYPERGRAPHS	1974	Dominic Welsh	1
+	Triangle-different Hamiltonian paths	2017	István Kovács Dániel Soltész	1
+	Foundations of Probability.	1971	M. Loeve A. Rényi	1
+ PDF Chat	A Combinatorial Proof of a Conjecture of Goldberg and Moon	1968	Brian Alspach	1
+ PDF Chat	New Bounds for Union-free Families of Sets	1998	Don Coppersmith James B. Shearer	1
+	Entropy, independent sets and antichains: A new approach to Dedekind’s problem	2001	Jeff Kahn	1
+	On the maximum number of qualitatively independent partitions	1989	Svatopluk Poljak Źsolt Tuza	1
+	On the Shannon Capacity of Probabilistic Graphs	1993	K. Marton	1
+ PDF Chat	Sperner's Problem for<i>G</i>-Independent Families	2014	Victor Falgas–Ravry	1
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	1
+	Alternating permutations and symmetric functions	2006	Richard P. Stanley	1
+ PDF Chat	On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order	1960	S. Chowla Paul Erdős E. G. Straus	1
+	Entropy splitting for antiblocking corners and perfect graphs	1990	Imre Csiszár János Körner László Lovász K. Marton Gábor Simonyi	1
+ PDF Chat	Sperner capacity of small digraphs	2009	Lasse Kiviluoto Patric R. J. Östergård Vesa P. Vaskelainen	1
+ PDF Chat	Connector Families of Graphs	2013	Gérard Cohen Emanuela Fachini János Körner	1
+	On Clique Growth in Products of Directed Graphs	1998	János Körner	1
+	Perfect couples of graphs	1992	János Körner Gábor Simonyi Zsolt Tuza	1