The following pages link to Dhruv Mubayi (Q168649):
Displayed 50 items.
- Maximum \(\mathcal{H}\)-free subgraphs (Q2041692) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- Cliques with many colors in triple systems (Q2073641) (← links)
- A hypergraph Turán problem with no stability (Q2095110) (← links)
- A unified approach to hypergraph stability (Q2101163) (← links)
- The feasible region of induced graphs (Q2101166) (← links)
- On explicit constructions of designs (Q2121799) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- The Erdős-Hajnal hypergraph Ramsey problem (Q2178253) (← links)
- Ordered and convex geometric trees with linear extremal function (Q2197686) (← links)
- A survey of hypergraph Ramsey problems (Q2232043) (← links)
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 (Q2309552) (← links)
- The number of triple systems without even cycles (Q2322549) (← links)
- Hypergraph Ramsey numbers: triangles versus cliques (Q2349183) (← links)
- Proof of a conjecture of Erdős on triangles in set-systems (Q2368590) (← links)
- Erdős--Ko--Rado for three sets (Q2368657) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- Eigenvalues of non-regular linear quasirandom hypergraphs (Q2374170) (← links)
- Bipartite coverings and the chromatic number (Q2380224) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- Off-diagonal hypergraph Ramsey numbers (Q2396897) (← links)
- Independence number of graphs with a prescribed number of cliques (Q2415089) (← links)
- Almost all triple systems with independent neighborhoods are semi-bipartite (Q2431618) (← links)
- Multicolor Ramsey numbers for triple systems (Q2436825) (← links)
- A new short proof of a theorem of Ahlswede and Khachatrian (Q2474500) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Non-uniform Turán-type problems (Q2484510) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- The co-degree density of the Fano plane (Q2573650) (← links)
- A hypergraph extension of Turán's theorem (Q2581504) (← links)
- Co-degree density of hypergraphs (Q2642025) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- (Q2741343) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Large induced forests in sparse graphs (Q2781059) (← links)
- Hypergraph Ramsey numbers: tight cycles versus cliques (Q2788661) (← links)
- Coloring Triple Systems with Local Conditions (Q2800545) (← links)
- Coloring Sparse Hypergraphs (Q2813339) (← links)
- Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
- Specified intersections (Q2862137) (← links)
- A Ramsey-Type Result for Geometric ℓ-Hypergraphs (Q2867673) (← links)
- On Even-Degree Subgraphs of Linear Hypergraphs (Q2883855) (← links)
- The Turán Number of<i>F</i><sub>3,3</sub> (Q2888871) (← links)
- Books Versus triangles (Q2888887) (← links)
- Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs (Q2922214) (← links)
- A survey of Turán problems for expansions (Q2957177) (← links)
- The structure of large intersecting families (Q2970053) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers (Q3147240) (← links)
- Counting independent sets in triangle-free graphs (Q3190316) (← links)