Pages that link to "Item:Q1417566"

The following pages link to Problems and results in extremal combinatorics. I. (Q1417566):

Displaying 50 items.

• Increasing paths in edge-ordered graphs: the hypercube and random graph (Q281608) (← links)
• A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
• Short proofs of some extremal results. II. (Q326811) (← links)
• Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
• Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
• Almost isometries and orthogonality (Q556236) (← links)
• On the distance concentration awareness of certain data reduction techniques (Q614077) (← links)
• A superadditivity and submultiplicativity property for cardinalities of sumsets (Q653776) (← links)
• On the induced matching problem (Q657915) (← links)
• Discrete uncertainty principles and sparse signal processing (Q667658) (← links)
• Improved linear embeddings via Lagrange duality (Q669310) (← links)
• On the size of incoherent systems (Q719361) (← links)
• A nonlinear approach to dimension reduction (Q894683) (← links)
• Problems and results in extremal combinatorics. II (Q941386) (← links)
• On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
• Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
• Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
• Altitude of regular graphs with girth at least five (Q1781975) (← links)
• No dimension reduction for doubling subsets of \(\ell_q\) when \(q>2\) revisited (Q2050873) (← links)
• Almost-equidistant sets (Q2175803) (← links)
• On the correlation measures of subsets (Q2189560) (← links)
• Nearly-linear monotone paths in edge-ordered graphs (Q2200054) (← links)
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
• Hadamard products and moments of random vectors (Q2213794) (← links)
• Impossibility of dimension reduction in the nuclear norm (Q2291451) (← links)
• Independent transversals in locally sparse graphs (Q2384801) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
• Large induced forests in triangle-free planar graphs (Q2494123) (← links)
• Smaller Gershgorin disks for multiple eigenvalues of complex matrices (Q2694879) (← links)
• Sets of unit vectors with small subset sums (Q2796088) (← links)
• Low Distortion Metric Embedding into Constant Dimension (Q3010393) (← links)
• On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• Short proofs of some extremal results III (Q3386524) (← links)
• On variants of the Johnson–Lindenstrauss lemma (Q3522833) (← links)
• Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
• Perturbed Identity Matrices Have High Rank: Proof and Applications (Q3557502) (← links)
• Representation and coding of signal geometry (Q4603712) (← links)
• A note on acyclic number of planar graphs (Q4604518) (← links)
• Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
• (Q4638103) (← links)
• (Q4638108) (← links)
• CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS (Q4658679) (← links)
• Large Induced Forests in Graphs (Q4978444) (← links)
• Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
• Intrinsic Complexity and Scaling Laws: From Random Fields to Random Vectors (Q5197617) (← links)