On forbidding graphs as traces of hypergraphs
From MaRDI portal
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A survey of Turán problems for expansions
- Counting copies of a fixed subgraph in F-free graphs
- Eine Extremalaufgabe aus der Graphentheorie.
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal results for Berge hypergraphs
- Forbidding \(K_{2,t}\) traces in triple systems
- Forbidding complete hypergraphs as traces
- scientific article; zbMATH DE number 4010523 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3298603 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Induced Turán problems and traces of hypergraphs
- Many \(T\) copies in \(H\)-free graphs
- On disjointly representable sets
- On non-degenerate Turán problems for expansions
- On supersaturation and stability for generalized Turán problems
- On the density of families of sets
- On the structure of linear graphs
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Supersaturation for subgraph counts
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The history of degenerate (bipartite) extremal graph problems
- Unified approach to the generalized Turán problem and supersaturation
- Vraagstuk XXVIII.
This page was built for publication: On forbidding graphs as traces of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874223)
