For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We pro...
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pik...
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
We develop a new method for coding sets while preserving gch in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carr...
The compound nouns are freely composed in Korean, since it is possible to concatenate independent nouns without a postposition. Therefore, the systems that handle compound nouns su...