The following pages link to Dhruv Mubayi (Q168649):
Displayed 50 items.
- Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
- Inverse expander mixing for hypergraphs (Q281623) (← links)
- Counting trees in graphs (Q311564) (← links)
- The independent neighborhoods process (Q312273) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Tree-minimal graphs are almost regular (Q353399) (← links)
- Two-part set systems (Q426823) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems (Q518192) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- New lower bounds for Ramsey numbers of graphs and hypergraphs (Q696820) (← links)
- A family of switch equivalent graphs (Q704278) (← links)
- An explicit construction for a Ramsey problem (Q705745) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- The DNF exception problem (Q818117) (← links)
- On the VC-dimension of uniform hypergraphs (Q857750) (← links)
- Supersaturation for Ramsey-Turán problems (Q858118) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- Quadruple systems with independent neighborhoods (Q958757) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs (Q1010732) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Edge-coloring cliques with three colors on all 4-cliques (Q1280308) (← links)
- Signed domination in regular graphs and set-systems (Q1306310) (← links)
- On hypergraphs with every four points spanning at most two triples (Q1408551) (← links)
- On a two-sided Turán problem (Q1422128) (← links)
- New upper bounds for a canonical Ramsey problem (Q1586336) (← links)
- The chromatic spectrum of mixed hypergraphs (Q1606033) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← links)
- A hypergraph extension of the bipartite Turán problem (Q1826942) (← links)
- On restricted edge-colorings of bicliques (Q1850030) (← links)
- On generalized Ramsey theory: The bipartite case (Q1850469) (← links)
- Generalizing the Ramsey problem through diameter (Q1856336) (← links)
- Intersecting curves in the plane (Q1865145) (← links)
- On the Turán number of triple systems (Q1865386) (← links)
- Stability theorems for cancellative hypergraphs (Q1880797) (← links)
- Uniform edge distribution in hypergraphs is hereditary (Q1883672) (← links)
- Coloring the cube with rainbow cycles (Q1953479) (← links)
- Counting substructures. I: Color critical graphs (Q1959675) (← links)
- The feasible region of hypergraphs (Q1998756) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)