scientific article; zbMATH DE number 3188526
From MaRDI portal
Publication:5724802
Recommendations
Cited in
(only showing first 100 items - show all)- On the number of certain subgraphs contained in graphs with a given number of edges
- Handle bases and bounds on the number of subgraphs
- The maximal number of induced complete bipartite graphs
- The number of triangles in a \(K_ 4\)-free graph
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Extremals of functions on graphs with applications to graphs and hypergraphs
- On the number of complete subgraphs contained in certain graphs
- On finite Ramsey numbers
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- The chromatic uniqueness of complete bipartite graphs
- Bounds on the number of complete subgraphs
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Two path extremal graphs and an application to a Ramsey-type problem
- The maximum number of triangles in a \(K_4\)-free graph
- On graphs in which any pair of colour classes but one induces a tree
- On the structure and chromaticity of graphs in which any two colour classes induce a tree
- Graph products and monochromatic multiplicities
- The number of complete subgraphs of equi-partite graphs
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds
- Some extremal results on complete degenerate hypergraphs
- The maximum number of cliques in graphs without long cycles
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- Edges not in any monochromatic copy of a fixed graph
- Star-critical Ramsey numbers for large generalized fans and books
- The maximal number of induced \(r\)-partite subgraphs
- A new Turán-type theorem for cliques in graphs
- Large generalized books are \(p\)-good
- Multiplicities of subgraphs
- On the distance of databases
- Counting substructures. I: Color critical graphs
- Many cliques with few edges and bounded maximum degree
- General lemmas for Berge-Turán hypergraph problems
- Some sharp results on the generalized Turán numbers
- Rainbow triangles and cliques in edge-colored graphs
- New short proofs to some stability theorems
- Flag complexes and homology
- Some results on k-Turán-good graphs
- Generalized Turán number of even linear forests
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Threshold Ramsey multiplicity for paths and even cycles
- Generalized outerplanar Turán number of short paths
- The maximum number of stars in a graph without linear forest
- Ramsey numbers of books and quasirandomness
- Generalized Turán densities in the hypercube
- The feasible region of induced graphs
- Counting cliques in 1-planar graphs
- Star-critical Ramsey numbers involving large books
- On a Paley-type graph on \({\mathbb{Z}}_n\)
- Supersaturation for subgraph counts
- Ramsey numbers of fans and large books
- Some exact results for generalized Turán problems
- Generalized rainbow Turán problems
- Generalized Turán number for linear forests
- Non-bipartite \(k\)-common graphs
- Upper tails via high moments and entropic stability
- The maximum number of cliques in hypergraphs without large matchings
- Maximising the number of cycles in graphs with forbidden subgraphs
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- Blowup Ramsey numbers
- On the number of connected subgraphs of graphs
- Minimal Ramsey graphs on deleting stars for generalized fans and books
- Counting copies of a fixed subgraph in F-free graphs
- Generalized Turán problems for disjoint copies of graphs
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- On a conjecture of Erdős for multiplicities of cliques
- Independence number of graphs with a prescribed number of cliques
- Structure and supersaturation for intersecting families
- Many triangles with few edges
- The maximum number of complete subgraphs in a graph with given maximum degree
- Extremal results in sparse pseudorandom graphs
- Bounds on graph eigenvalues. II
- On a Ramsey type theorem
- Triangles in space or building (and analyzing) castles in the air
- Some corollaries of a theorem of Whitney on the chromatic polynomial
- Complete subgraphs in connected graphs and its application to spectral moment
- The maximum number of paths of length four in a planar graph
- The number of triangles is more when they have no common vertex
- Generalized planar Turán numbers
- Generalized rainbow Turán numbers of odd cycles
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- Turán problems for \(k\)-geodetic digraphs
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Subgraph densities in \(K_r\)-free graphs
- Triangles in graphs without bipartite suspensions
- Some exact results of the generalized Turán numbers for paths
- Counting substructures and eigenvalues. I: Triangles
- A randomized version of Ramsey's theorem
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- The maximum number of complete subgraphs of fixed size in a graph with given maximum degree
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 4200235 (Why is no real title available?)
- Short proofs of some extremal results. III
- scientific article; zbMATH DE number 4145688 (Why is no real title available?)
- Combinatorial theorems in sparse random sets
- scientific article; zbMATH DE number 3941573 (Why is no real title available?)
- scientific article; zbMATH DE number 3948308 (Why is no real title available?)
- scientific article; zbMATH DE number 4053653 (Why is no real title available?)
- scientific article; zbMATH DE number 3655979 (Why is no real title available?)
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 Q5724802)
