On hypergraphs with every four points spanning at most two triples.
The Electronic Journal of Combinatorics [electronic only] (2003)
- Volume: 10, Issue: 1, page Research paper N10, 4 p.-Research paper N10, 4 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topMubayi, Dhruv. "On hypergraphs with every four points spanning at most two triples.." The Electronic Journal of Combinatorics [electronic only] 10.1 (2003): Research paper N10, 4 p.-Research paper N10, 4 p.. <http://eudml.org/doc/122970>.
@article{Mubayi2003,
author = {Mubayi, Dhruv},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper N10, 4 p.-Research paper N10, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On hypergraphs with every four points spanning at most two triples.},
url = {http://eudml.org/doc/122970},
volume = {10},
year = {2003},
}
TY - JOUR
AU - Mubayi, Dhruv
TI - On hypergraphs with every four points spanning at most two triples.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2003
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 10
IS - 1
SP - Research paper N10, 4 p.
EP - Research paper N10, 4 p.
LA - eng
UR - http://eudml.org/doc/122970
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.