Pattern hypergraphs.
Dvořák, Zdeněk, Kára, Jan, Král', Daniel, Pangrác, Ondřej (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The Turán problem for hypergraphs on fixed size.”
Pattern hypergraphs.
Some results on chromatic polynomials of hypergraphs.
Walter, Manfred (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
On total matching numbers and total covering numbers for -uniform hypergraphs
František Olejník (1984)
Mathematica Slovaca
Similarity:
On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Generalized Ramsey numbers for paths in 2-chromatic graphs.
Meenakshi, R., Sundararaghavan, P.S. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity: