22 citations · 56 across the 5 of their papers we have counts for
5 papers
A simple regularization of graphs
Yoshiyasu Ishigami
The well-known regularity lemma of E. Szemerédi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomn…
The number of hypergraphs and colored Hypergraphs with hereditary properties
Yoshiyasu Ishigami
As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)…
A Simple Regularization of Hypergraphs
Yoshiyasu Ishigami
We give a simple and natural (probabilistic) construction of hypergraph regularization. It is done just by taking a constant-bounded number of random vertex samplings only one time…
Removal lemma for infinitely-many forbidden hypergraphs and property testing
Yoshiyasu Ishigami
We give an extension of a graph result by Alon and Shapira. And it affirmatively settles a question on property testing raised by them. All monotone hypergraph properties and all h…
Linear Ramsey numbers for bounded-degree hypergraphs
Yoshiyasu Ishigami
We show that the Ramsey number is linear for every uniform hypergraph with bounded-degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chvátal et…