scientific article; zbMATH DE number 3041944
From MaRDI portal
Publication:5781249
Cited in
(only showing first 100 items - show all)- Linear hash families and forbidden configurations
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Fibonacci index and stability number of graphs: a polyhedral study
- On non-strong jumping numbers and density structures of hypergraphs
- Maximum induced trees in graphs
- Another extremal problem for Turan graphs
- Intersection properties of boxes. I: An upper-bound theorem
- Embedding partial triple systems
- Exact solution of some Turán-type problems
- Forbidden graphs for degree and neighbourhood conditions
- Large dense neighbourhoods and Turán's theorem
- Triangle-free partial graphs and edge covering theorems
- Lower bounds on the stability number of graphs computed in terms of degrees
- Edges in graphs with large girth
- Intersection properties of boxes. II: Extremal families
- Saturated r-uniform hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Développements recents de la théorie des graphes
- The intersection numbers of a complex
- Equipartite colorings in graphs and hypergraphs
- On graphs which contain all small trees
- Induced subgraphs of given sizes
- An upper bound for the Turán number \(t_3(n,4)\)
- Turán's theorem and maximal degrees
- Extremal problems and generalized degrees
- Largest size and union of Helly families
- On unique independent sets in graphs
- The decision-tree complexity of element distinctness
- The size of graphs with clique number \(m\) and without nowhere-zero 4-flows
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
- The VC-dimension of set systems defined by graphs
- Improved approximations for maximum independent set via approximation chains
- Embedding partial extended triple systems and totally symmetric quasigroups
- The extremal graph problem of the icosahedron
- On a geometric combinatorial problem
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
- Maximum cliques of hypergraphs and polynomial optimization
- The ferry cover problem on regular graphs and small-degree graphs
- Gaps in the saturation spectrum of trees
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- On ordered Ramsey numbers of bounded-degree graphs
- Turán function and H-decomposition problem for gem graphs
- Retracted: A remark on the weak Turán's theorem
- On the Turán number of some ordered even cycles
- Some extremal results on complete degenerate hypergraphs
- The minimum number of triangles in graphs of given order and size
- Turán numbers for odd wheels
- Degree powers in graphs with a forbidden forest
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
- Edges not in any monochromatic copy of a fixed graph
- Strong forms of stability from flag algebra calculations
- The Turán number for spanning linear forests
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- Spectral extremal results with forbidding linear forests
- Dense subgraphs in random graphs
- Dense 3-uniform hypergraphs containing a large clique
- Bipartite algebraic graphs without quadrilaterals
- Colourings without monochromatic disjoint pairs
- Extremal numbers for directed hypergraphs with two edges
- On the existence of Frobenius digraphical representations
- Conditional chromatic numbers with forbidden cycles
- Embeddings of partial Steiner triple systems
- The number of graphs without forbidden subgraphs
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Testing metric properties
- Greedy clique decompositions and the Turán numbers
- Triangle-free four-chromatic graphs
- Extremal theory for convex matchings in convex geometric graphs
- Uniquely \(C _{4}\)-saturated graphs
- The non-isolated vertices in the generating graph of a direct powers of simple groups.
- Nonatomic mutual exclusion with local spinning
- Unavoidable hypergraphs
- The feasible region of hypergraphs
- Dense induced bipartite subgraphs in triangle-free graphs
- On local Turán problems
- Some sharp results on the generalized Turán numbers
- Packing triangles in \(K_4\)-free graphs
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Flag complexes and homology
- Some results on k-Turán-good graphs
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
- Cut and pendant vertices and the number of connected induced subgraphs of a graph
- Generalized Turán number of even linear forests
- Relative Turán numbers for hypergraph cycles
- Packing and covering balls in graphs excluding a minor
- The lower and upper bounds of Turán number for odd wheels
- A universal exponent for homeomorphs
- On the Turán number of theta graphs
- Triangle-free subgraphs of hypergraphs
- A note on stability for maximal \(F\)-free graphs
- Unified approach to the generalized Turán problem and supersaturation
- Small rainbow cliques in randomly perturbed dense graphs
- A sharp threshold phenomenon in string graphs
- On the maximal number of elements pairwise generating the symmetric group of even degree
- On the maxima of Motzkin-Straus programs and cliques of graphs
- On subgraphs of tripartite graphs
- Generalized outerplanar Turán number of short paths
- The structure of graphs with given lengths of cycles
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
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)