Pages that link to "Item:Q3008019"
From MaRDI portal
The following pages link to On 3-Hypergraphs with Forbidden 4-Vertex Configurations (Q3008019):
Displaying 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. (Q343331) (← links)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- Monochromatic triangles in three-coloured graphs (Q463289) (← links)
- On possible Turán densities (Q466081) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- On the maximum number of five-cycles in a triangle-free graph (Q713972) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- An exact Turán result for tripartite 3-graphs (Q888608) (← links)
- On Turán densities of small triple graphs (Q896067) (← links)
- On hypergraphs with every four points spanning at most two triples (Q1408551) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- The Turán polytope (Q1671668) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- On the maximum density of fixed strongly connected subtournaments (Q1733920) (← links)
- On local Turán problems (Q2005200) (← links)
- A hypergraph Turán problem with no stability (Q2095110) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Extremal problems in uniformly dense hypergraphs (Q2189833) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Simple graph density inequalities with no sum of squares proofs (Q2221001) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- On Turán's \((3,4)\)-problem with forbidden subgraphs (Q2341979) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Turán, involution and shifting (Q2421565) (← links)
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem (Q2510770) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- On the maximum quartet distance between phylogenetic trees (Q2800184) (← links)
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs (Q2853341) (← links)
- Non-three-colourable common graphs exist (Q2911071) (← links)
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods (Q2944457) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- (Q4683860) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- An Irrational Lagrangian Density of a Single Hypergraph (Q5067428) (← links)
- Tropicalization of graph profiles (Q5098834) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number (Q5397739) (← links)
- The Inducibility of Graphs on Four Vertices (Q5417819) (← links)