scientific article; zbMATH DE number 3041944
From MaRDI portal
Publication:5781249
Cited in
(only showing first 100 items - show all)- The maximum number of triangles in \(F_k\)-free graphs
- Développements recents de la théorie des graphes
- Many \(T\) copies in \(H\)-free graphs
- Many \(T\) copies in \(H\)-free graphs
- Nearly-regular hypergraphs and saturation of Berge stars
- On unique independent sets in graphs
- Testing metric properties
- Guessing numbers and extremal graph theory
- Unavoidable hypergraphs
- On finite simple groups and Kneser graphs.
- A 2-stable family of triple systems
- Maker-Breaker games on randomly perturbed graphs
- On a valence problem in extremal graph theory
- On off-diagonal ordered Ramsey numbers of nested matchings
- The exact minimum number of triangles in graphs with given order and size
- A note on stability for maximal \(F\)-free graphs
- ?Best? estimations on the distribution of the length of sums of two random vectors
- A note on kernels of intersecting families
- On the codegree density of complete 3-graphs and related problems
- A maximum degree theorem for diameter-2-critical graphs
- On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
- An application of the Turán theorem to domination in graphs
- The maximum number of colorings of graphs of given order and size: a survey
- A note on Turán numbers for even wheels
- On local Turán problems
- An upper bound for the Turán number \(t_3(n,4)\)
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- Supersaturation for subgraph counts
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- A note on an embedding problem in transitive tournaments
- The extremal graph problem of the icosahedron
- All my favorite conjectures are critical
- Improved bounds on a generalization of Tuza's conjecture
- Extremal graphs for blow-ups of stars and paths
- Turán numbers for hypergraph star forests
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Graphs with coloring redundant edges
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
- Some sharp results on the generalized Turán numbers
- A note on independent sets in graphs with large minimum degree and small cliques
- Extremal problems for the p-spectral radius of graphs
- Some extremal problems for hereditary properties of graphs
- Constructing heterogeneous hash families by puncturing linear transversal designs
- Spectral extremal graphs for edge blow-up of star forests
- Remarks on an edge-coloring problem
- Combinatorial upper bounds for the smallest eigenvalue of a graph
- Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants
- Counting cliques in 1-planar graphs
- Maximising the number of cycles in graphs with forbidden subgraphs
- The domination number of the graph defined by two levels of the \(n\)-cube. II
- Spectral extremal graphs for intersecting cliques
- The constructor-blocker game
- The Turán numbers of special forests
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- New bounds on the signed total domination number of graphs
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The spectral radius of graphs with no intersecting odd cycles
- The maximum spectral radius of graphs without spanning linear forests
- On the domination number of a graph defined by containment
- The feasible region of hypergraphs
- scientific article; zbMATH DE number 7731171 (Why is no real title available?)
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- Combinatorics on partial word borders
- Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs
- Four-vertex traces of finite sets
- Transversals in regular uniform hypergraphs
- Flag complexes and homology
- Nonatomic mutual exclusion with local spinning
- Combinatorial theorems in sparse random sets
- Extremal results for random discrete structures
- A note on bipartite subgraphs and triangle-independent sets
- Embedding partial triple systems
- Dense 3-uniform hypergraphs containing a large clique
- Improved bound on the maximum number of clique-free colorings with two and three colors
- Global aspects of the space of 6D \(\mathcal{N} = 1\) supergravities
- The non-isolated vertices in the generating graph of a direct powers of simple groups.
- A randomized version of Ramsey's theorem
- Vertex Turán problems for the oriented hypercube
- The maximum edit distance from hereditary graph properties
- Dense induced bipartite subgraphs in triangle-free graphs
- The Forest Number of (n,m)-Graphs
- Extremal graphs for two vertex-disjoint copies of a clique
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Tree decompositions of graphs without large bipartite holes
- Shattered matchings in intersecting hypergraphs
- Super-edge-connectivity and zeroth-order Randić index
- On Lagrangians of \(r\)-uniform hypergraphs
- Extremal k-forcing sets in oriented graphs
- The Turán number of the graph 3P5
- scientific article; zbMATH DE number 7646868 (Why is no real title available?)
- Embedding partial totally symmetric quasigroups.
- scientific article; zbMATH DE number 7674538 (Why is no real title available?)
- Generalized Tuza's conjecture for random hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
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 Q5781249)