Pages that link to "Item:Q2394998"
From MaRDI portal
The following pages link to On extremal problems of graphs and generalized graphs (Q2394998):
Displaying 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Regular subgraphs of uniform hypergraphs (Q273181) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Extremal results for random discrete structures (Q350549) (← links)
- A hypergraph Turán theorem via Lagrangians of intersecting families (Q388725) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- Note on upper density of quasi-random hypergraphs (Q396781) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- On possible Turán densities (Q466081) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Forbidden configurations and product constructions (Q489298) (← links)
- Boolean algebras and Lubell functions (Q490915) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- On multiaspect graphs (Q517022) (← links)
- Forbidden Berge hypergraphs (Q521388) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- The typical structure of graphs with no large cliques (Q681594) (← links)
- New lower bounds for Ramsey numbers of graphs and hypergraphs (Q696820) (← links)
- The number of graphs with large forbidden subgraphs (Q710718) (← links)
- Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
- Zarankiewicz's problem for semi-algebraic hypergraphs (Q721064) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- 2-factors with \(k\) cycles in Hamiltonian graphs (Q777484) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Distinct distances determined by subsets of a point set in space (Q808426) (← links)
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
- On the toric ideals of matroids of a fixed rank (Q829621) (← links)
- On substructure densities of hypergraphs (Q844225) (← links)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (Q850077) (← links)
- A note on the jumping constant conjecture of Erdős (Q864899) (← links)
- Non-jumping numbers for 4-uniform hypergraphs (Q878060) (← links)
- Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390) (← links)
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Powers of Hamilton cycles in tournaments (Q923097) (← links)
- A note on the structure of Turán densities of hypergraphs (Q937246) (← links)
- Generating non-jumping numbers recursively (Q944738) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Vertex Turán problems in the hypercube (Q965224) (← links)
