Proof of an intersection theorem via graph homomorphisms.
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper N6, 4 p.-Research paper N6, 4 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topDinur, Irit, and Friedgut, Ehud. "Proof of an intersection theorem via graph homomorphisms.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper N6, 4 p.-Research paper N6, 4 p.. <http://eudml.org/doc/125956>.
@article{Dinur2006,
author = {Dinur, Irit, Friedgut, Ehud},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper N6, 4 p.-Research paper N6, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Proof of an intersection theorem via graph homomorphisms.},
url = {http://eudml.org/doc/125956},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Dinur, Irit
AU - Friedgut, Ehud
TI - Proof of an intersection theorem via graph homomorphisms.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper N6, 4 p.
EP - Research paper N6, 4 p.
LA - eng
UR - http://eudml.org/doc/125956
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.