Hypergraph anti-Ramsey theorems
From MaRDI portal
Cites work
- A hypergraph extension of Turán's theorem
- A survey of Turán problems for expansions
- A unified approach to hypergraph stability
- A variant of the hypergraph removal lemma
- An anti-Ramsey theorem
- Anti-Ramsey number of disjoint union of star-like hypergraphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Anti-Ramsey number of matchings in a hypergraph
- Anti-Ramsey number of matchings in hypergraphs
- Anti-Ramsey numbers of doubly edge-critical graphs
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Anti-Ramsey numbers of subdivided graphs
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Eine Extremalaufgabe aus der Graphentheorie.
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3458515 (Why is no real title available?)
- scientific article; zbMATH DE number 736291 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- Rainbow generalizations of Ramsey theory: A survey
- The counting lemma for regular k‐uniform hypergraphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- What we know and what we do not know about Turán numbers
Cited in
(2)
This page was built for publication: Hypergraph anti-Ramsey theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009621)
