scientific article; zbMATH DE number 3224335
From MaRDI portal
Publication:5512796
Cited in
(only showing first 100 items - show all)- On non-strong jumping numbers and density structures of hypergraphs
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- A note on the probabilistic approach to Turan's problem
- On a packing and covering problem
- Lower bounds for Turán's problem
- A new approach to Turán's conjecture
- Coloring graphs with locally few colors
- Exact solution of some Turán-type problems
- Certain recurrent and asymptotic estimates in the covering problem
- Sums of vectors and Turan's problem for 3-graphs
- On the lotto problem
- Asymptotic solution of the Turán problem for some hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Equipartite colorings in graphs and hypergraphs
- On Turan hypergraphs
- A Turán type problem concerning the powers of the degrees of a graph
- Maximum cliques of hypergraphs and polynomial optimization
- Turán function and H-decomposition problem for gem graphs
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- What we know and what we do not know about Turán numbers
- On Turán numbers of the complete 4-graphs
- On local Turán problems
- New short proofs to some stability theorems
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
- Choice number of Kneser graphs
- Extremal problems in uniformly dense hypergraphs
- New bounds for a hypergraph bipartite Turán problem
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- Analytic methods for uniform hypergraphs
- Asymptotic solution of a Turán-type problem
- A note on Turán's theorem
- Degenerate Turán densities of sparse hypergraphs
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- Non-jumping numbers for 5-uniform hypergraphs
- Around Borsuk's hypothesis
- On some extremal problems on r-graphs
- Turan's theorem for k-graphs
- On the algebraic and topological structure of the set of Turán densities
- A Turán-type problem on distances in graphs
- Co-degree density of hypergraphs
- Extremal problems for multigraphs
- Turán problems for integer-weighted graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Extremal results for random discrete structures
- The Chromatic Number of Kneser Hypergraphs
- Algorithmic Solution of Extremal Digraph Problems
- Independence densities of hypergraphs
- Some extremal problems for hereditary properties of graphs
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- On possible Turán densities
- Turán problems on non-uniform hypergraphs
- Minimum number of affine simplices of given dimension
- An irrational Lagrangian density of a single hypergraph
- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- Exchange properties of finite set-systems
- Relative Turán problems for uniform hypergraphs
- On Turán problems for Cartesian products of graphs
- Triple systems with no three triples spanning at most five points
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Turán Problems and Shadows III: Expansions of Graphs
- Large sets of \(t\)-designs and a Ramsey-type problem
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- On a problem in the geometry of numbers
- Weakly saturated hypergraphs and a conjecture of Tuza
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Hypergraph Turán densities can have arbitrarily large algebraic degree
- On supersaturation and stability for generalized Turán problems
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
- Lagrangian-perfect hypergraphs
- On Turán numbers for disconnected hypergraphs
- Uniform Turán density of cycles
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Lagrangian densities of linear forests and Turán numbers of their extensions
- On asymptotic local Turán problems
- On the limit of the positive -degree Turán problem
- Hypergraphs with independent neighborhoods
- Properly edge-coloured subgraphs in colourings of bounded degree
- Hypergraphs with minimum positive uniform Turán density
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- Generating non-jumps from a known one
- On the boundedness of degenerate hypergraphs
- A note on the minimum size of Turán systems
- Separating hypergraph Turán densities
- The signless Laplacian spectral Turán problems for color-critical graphs
- Principal eigenvectors in hypergraph Turán problems
- Blocking planes by lines in \(\mathrm{PG}(n,q)\)
- A signless Laplacian spectral Erdős-Stone-Simonovits theorem
- Positive co-degree density of hypergraphs
- On perfect subdivision tilings (extended abstract)
- Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
- Finite hypergraph families with rich extremal Turán constructions via mixing patterns
- Hypergraphs accumulate
- Tournaments, Johnson graphs and NC-teaching
- Constructions of Turán systems that are tight up to a multiplicative constant
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- The -spectral Turán type problems for graphs
- Hypergraphs of arbitrary uniformity with vanishing codegree Turán density
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512796)