scientific article; zbMATH DE number 3262986
From MaRDI portal
Publication:5548826
Cited in
(only showing first 100 items - show all)- Unit distances and diameters in Euclidean spaces
- Set systems with union and intersection constraints
- Two-regular subgraphs of hypergraphs
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- Turán's theorem inverted
- On the number of edge disjoint cliques in graphs of given size
- On graphs \(G\) for which all large trees are \(G\)-good
- The extremal graph problem of the icosahedron
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Stability results for graphs with a critical edge
- Some extremal results on complete degenerate hypergraphs
- Two-regular subgraphs of odd-uniform hypergraphs
- The flag upper bound theorem for 3- and 5-manifolds
- Turán numbers of extensions
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- The minimum number of triangles in graphs of given order and size
- Turán numbers for odd wheels
- Edges not in any monochromatic copy of a fixed graph
- Strong forms of stability from flag algebra calculations
- 0-1 matrices with zero trace whose squares are 0-1 matrices
- Forbidding induced even cycles in a graph: typical structure and counting
- Books in graphs
- Star-critical Ramsey numbers for large generalized fans and books
- A note on a conjecture of Gallai
- The number of graphs without forbidden subgraphs
- Stability theorems for cancellative hypergraphs
- Multicolour Turán problems
- Counting substructures. I: Color critical graphs
- A note on the Turán number of disjoint union of wheels
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- An Erdős-Gallai type theorem for vertex colored graphs
- The Turán number of star forests
- Some sharp results on the generalized Turán numbers
- Chromatic number via Turán number
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- An extension of the rainbow Erdős-Rothschild problem
- On Turán-good graphs
- Inverting the Turán problem with chromatic number
- Star-critical Ramsey numbers of generalized fans
- On the Turán number of theta graphs
- A note on stability for maximal \(F\)-free graphs
- On the Turán numbers of k K_r in -partite graphs
- A hypergraph Turán problem with no stability
- A unified approach to hypergraph stability
- Tight bounds for powers of Hamilton cycles in tournaments
- A linear hypergraph extension of Turán's theorem
- Star-critical Ramsey numbers involving large books
- Extremal graphs for two vertex-disjoint copies of a clique
- Ramsey numbers of fans and large books
- Spectral extremal graphs for intersecting cliques
- The Turán numbers of special forests
- Some exact results for generalized Turán problems
- A note on the Turán number of an arbitrary star forest
- The spectral radius of graphs with no intersecting odd cycles
- Extremal graphs of the \(p\)th power of paths
- Turán number of disjoint triangles in 4-partite graphs
- The Turán number for \(4 \cdot S_{\ell}^1\)
- Star-critical Ramsey numbers involving large generalized fans
- Extremal problems in uniformly dense hypergraphs
- Generalized Turán problems for even cycles
- The Turán number of \(k \cdot S_\ell \)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The spectral radius of graphs with no odd wheels
- Some new results on the Turán number of star forests
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Finitely forcible graphons
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Minimal Ramsey graphs on deleting stars for generalized fans and books
- Two results about the Turán number of star forests
- Extremal digraphs avoiding an orientation of \(C_4\)
- The Turań number of \(2P_7\)
- The maximum number of colorings of graphs of given order and size: a survey
- Generalized Turán problems for disjoint copies of graphs
- A remark on the number of edge colorings of graphs
- The Turán number of disjoint copies of paths
- An intersection theorem for four sets
- Additive approximation for edge-deletion problems
- Stability for vertex cycle covers
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Turán number and decomposition number of intersecting odd cycles
- Extremal results in sparse pseudorandom graphs
- On some extremal problems on r-graphs
- Extremal problems for directed graphs
- Osculation vertices in arrangements of curves
- On a valence problem in extremal graph theory
- On the algebraic and topological structure of the set of Turán densities
- Monotone maps, sphericity and bounded second eigenvalue
- A hierarchy of randomness for graphs
- A hypergraph extension of Turán's theorem
- On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)
- The maximum spectral radius of wheel-free graphs
- Extremal graphs for edge blow-up of graphs
- The chromatic profile of locally bipartite graphs
- Graphs with large maximum degree containing no edge-critical graphs
- On a conjecture of spectral extremal problems
- Spectral extremal graphs for disjoint cliques
- Turán problems for \(k\)-geodetic digraphs
- The Turán number for the edge blow-up of trees: the missing case
- Stability theorems for some Kruskal-Katona type results
- Some exact results of the generalized Turán numbers for paths
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 Q5548826)