Fineness in the category of all 0-dimensional uniform spaces
Note on packing and covering Turán numbers
Canonical partition relations and point character of -spaces
Uniform edge distribution in hypergraphs is hereditary.
On the Turán properties of infinite graphs.
Holes in graphs.
Perfect matchings in -regular graphs.
On systems of graphs intersecting in paths
A non-zero dimensional atom
Families of triples with high minimum degree are hamiltonian
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least [...] contains a tight Hamiltonian cycle
Atomy ve svazu uniformit
Orthogonal partitions and covering of graphs
On classes of graphs determined by forbidden subgraphs
More on the complexity of cover graphs
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
On number of covering arcs in orderings
On generating of relations
Partite construction and Ramseyan theorems for sets, numbers and spaces
Large trees in random graphs
Partitions of vertices
Van der Waerden theorem for sequences of integers not containing an arithmetic progression of terms
Page 1 Next