The following pages link to (Q3768936):
Displaying 50 items.
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices (Q260016) (← links)
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
- A characterization of functions with vanishing averages over products of disjoint sets (Q281937) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics (Q447926) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- Extrema of graph eigenvalues (Q492762) (← links)
- Quasi-random graphs and graph limits (Q648965) (← links)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs (Q685676) (← links)
- A new upper bound for diagonal Ramsey numbers (Q731208) (← links)
- Limits of dense graph sequences (Q859618) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- Turán's theorem for pseudo-random graphs (Q880006) (← links)
- Matrix and discrepancy view of generalized random and quasirandom graphs (Q908195) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Weak hypergraph regularity and linear hypergraphs (Q965243) (← links)
- Quasi-random subsets of \(\mathbb{Z}_ n\) (Q1194750) (← links)
- On testing the `pseudo-randomness' of a hypergraph (Q1195483) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- Scaling of weighted spectral distribution in deterministic scale-free networks (Q1619437) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- The step Sidorenko property and non-norming edge-transitive graphs (Q1633367) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
- On the maximum density of fixed strongly connected subtournaments (Q1733920) (← links)
- Discrepancy minimizing spectral clustering (Q1752470) (← links)
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
- Pseudo-random hypergraphs (Q1812585) (← links)
- A simple linear expected time algorithm for finding a Hamilton path (Q1823260) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- Hermitian matrices and graphs: Singular values and discrepancy (Q1877646) (← links)
- Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
- Linear dependence between hereditary quasirandomness conditions (Q1991420) (← links)
- The normalized matching property in random and pseudorandom bipartite graphs (Q2034078) (← links)
- Tournament quasirandomness from local counting (Q2036620) (← links)
- Multigraph limits, unbounded kernels, and Banach space decorated graphs (Q2056409) (← links)
- Ramsey numbers of books and quasirandomness (Q2095106) (← links)
- No additional tournaments are quasirandom-forcing (Q2107498) (← links)
- Two remarks on graph norms (Q2118224) (← links)
- Hamiltonicity in cherry-quasirandom 3-graphs (Q2122670) (← links)
- A clique-free pseudorandom subgraph of the pseudo polarity graph (Q2138963) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- More on quasi-random graphs, subgraph counts and graph limits (Q2255808) (← links)
- Clique-factors in sparse pseudorandom graphs (Q2323252) (← links)
- Quasirandom permutations are characterized by 4-point densities (Q2375768) (← links)
- Counting results for sparse pseudorandom hypergraphs. I. (Q2400983) (← links)
- Counting results for sparse pseudorandom hypergraphs. II. (Q2400984) (← links)
- Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
- Generalized quasirandom graphs (Q2464159) (← links)
