The following pages link to Yoshiharu Kohayakawa (Q285061):
Displayed 50 items.
- The number of \(B_3\)-sets of a given cardinality (Q285063) (← links)
- Item:Q285061 (redirect page) (← links)
- A counting lemma for sparse pseudorandom hypergraphs (Q324872) (← links)
- Densities in large permutations and parameter testing (Q338581) (← links)
- On an anti-Ramsey threshold for random graphs (Q402453) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- A note on supersaturated set systems (Q499460) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
- Small subsets inherit sparse \(\varepsilon\)-regularity (Q858679) (← links)
- Turán's theorem for pseudo-random graphs (Q880006) (← links)
- Weak hypergraph regularity and linear hypergraphs (Q965243) (← links)
- On the resilience of long cycles in random graphs (Q1010740) (← links)
- An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (Q1010862) (← links)
- Partitioning by monochromatic trees (Q1125948) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- On small graphs with highly imperfect powers (Q1198509) (← links)
- Induced Ramsey numbers (Q1288912) (← links)
- The spectral gap of the REM under Metropolis dynamics (Q1296612) (← links)
- Percolation in high dimensions (Q1317491) (← links)
- An extension of the Erdős-Stone theorem (Q1340136) (← links)
- The size of the largest bipartite subgraphs (Q1377883) (← links)
- Packing and covering triangles in tripartite graphs (Q1385295) (← links)
- On \(K^ 4\)-free subgraphs of random graphs (Q1385983) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- On the number of \(r\)-transitive orientations of \(G(n,p)\) (Q1689921) (← links)
- Estimating the distance to a hereditary graph property (Q1689980) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- On hypergraphs without loose cycles (Q1699534) (← links)
- Multidimensional cube packing (Q1762987) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- A density result for random sparse oriented graphs and its relation to a conjecture of Woodall (Q1856340) (← links)
- Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
- Sparse anti-Ramsey graphs (Q1892836) (← links)
- Turán's extremal problem in random graphs: Forbidding even cycles (Q1898722) (← links)
- Invariant measures for a two-species asymmetric process (Q1906383) (← links)
- Turán's extremal problem in random graphs: Forbidding odd cycles (Q1912754) (← links)
- Limits of permutation sequences (Q1932475) (← links)
- On strong Sidon sets of integers (Q2040499) (← links)
- Integer colorings with no rainbow 3-term arithmetic progression (Q2138586) (← links)
- The multicolour size-Ramsey number of powers of paths (Q2200928) (← links)
- A note on kernels of intersecting families (Q2277266) (← links)
- Property testing for point sets on the plane (Q2294716) (← links)
- A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (Q2294729) (← links)
- Clique-factors in sparse pseudorandom graphs (Q2323252) (← links)
- Counting results for sparse pseudorandom hypergraphs. I. (Q2400983) (← links)
- Counting results for sparse pseudorandom hypergraphs. II. (Q2400984) (← links)