Pages that link to "Item:Q1895823"

The following pages link to What we know and what we do not know about Turán numbers (Q1895823):

Displaying 50 items.

• Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
• On minimum saturated matrices (Q367048) (← links)
• On the codegree density of complete 3-graphs and related problems (Q396955) (← links)
• On possible Turán densities (Q466081) (← links)
• Turán problems on non-uniform hypergraphs (Q470944) (← links)
• Minimum number of affine simplices of given dimension (Q476315) (← links)
• The effect of edge weights on clique weights (Q501285) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
• Properly edge-coloured subgraphs in colourings of bounded degree (Q659683) (← links)
• Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
• The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
• On non-strong jumping numbers and density structures of hypergraphs (Q1043558) (← links)
• Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) (Q1044999) (← links)
• Connected coverings and an application to oriented matroids (Q1584290) (← links)
• Complexity of choosing subsets from color sets (Q1584428) (← links)
• The Turán number for spanning linear forests (Q1720343) (← links)
• Stability theorems for cancellative hypergraphs (Q1880797) (← links)
• On Turán numbers of the complete 4-graphs (Q1981665) (← links)
• Unavoidable hypergraphs (Q1984522) (← links)
• The signless Laplacian spectral radius of graphs with no intersecting triangles (Q2020639) (← links)
• On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
• A hypergraph Turán problem with no stability (Q2095110) (← links)
• Saturation numbers for disjoint stars (Q2099391) (← links)
• Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
• Guessing numbers and extremal graph theory (Q2152800) (← links)
• A spectral condition for the existence of the square of a path (Q2159404) (← links)
• Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
• The formula for Turán number of spanning linear forests (Q2185927) (← links)
• General independence sets in random strongly sparse hypergraphs (Q2190919) (← links)
• On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
• The maximum spectral radius of graphs without friendship subgraphs (Q2209893) (← links)
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397) (← links)
• The spectral radius of graphs with no odd wheels (Q2237854) (← links)
• On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
• Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
• New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
• Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
• On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
• Non-uniform Turán-type problems (Q2484510) (← links)
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem (Q2510770) (← links)
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
• The maximum spectral radius of wheel-free graphs (Q2659251) (← links)
• Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
• The Turán number of directed paths and oriented cycles (Q2701405) (← links)
• (Q2713359) (← links)
• Daisies and Other Turán Problems (Q3103623) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
• Extremal Graphs with Local Covering Conditions (Q3300760) (← links)