scientific article; zbMATH DE number 3232670
From MaRDI portal
Publication:5520566
Cited in
(only showing first 100 items - show all)- On the homogeneous algebraic graphs of large girth and their applications
- The maximum spectral radius of C₄-free graphs of given order and size
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- The maximum size of hypergraphs without generalized 4-cycles
- A problem on algebraic graph theory
- Ramsey numbers based on \(C_ 5\)-decompositions
- Some applications of Ramsey's theorem to additive number theory
- On the coverings of graphs
- Regular separable graphs of minimum order with given diameter
- Graphs whose every independent set has a common neighbour
- On a Turán type problem of Erdős
- Davenport-Schinzel theory of matrices
- Cycle-connected graphs
- Graphs from projective planes
- Ramsey graphs and block designs
- A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
- Radius, diameter, and minimum degree
- Polarities and \(2k\)-cycle-free graphs
- Norm-graphs: Variations and applications
- Intersecting designs from linear programming and graphs of diameter two
- A graph-theoretic result for a model of neural computation
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- On completely positive graphs and their complements
- An approach to solving \(A^{k}=J-I\)
- Wavelength routing in optical networks of diameter two
- Impossibility of order-revealing encryption in idealized models
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- Some extremal results on complete degenerate hypergraphs
- Two-regular subgraphs of odd-uniform hypergraphs
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Bipartite algebraic graphs without quadrilaterals
- A family of graphs that are determined by their normalized Laplacian spectra
- Matchings and covers in hypergraphs
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Some geometric structures and bounds for Ramsey numbers
- Graphs without quadrilaterals
- Cycles of even length in graphs
- One method for proving the impossibility of certain Moore graphs
- On generalized Ramsey theory: The bipartite case
- A variation of a classical Turán-type extremal problem
- On product representation of powers. I
- The number of 2-dominating sets, and 2-domination polynomial of a graph
- Steiner diameter, maximum degree and size of a graph
- Some extremal results on 4-cycles
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- On the mutual visibility in Cartesian products and triangle-free graphs
- Tight bounds for powers of Hamilton cycles in tournaments
- Inverse Turán numbers
- Optimal monomial quadratization for ODE systems
- \(C_4\)-free subgraphs with large average degree
- Generalized rainbow Turán problems
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- Some extremal results on hypergraph Turán problems
- First-order network coherence in 5-rose graphs
- The number of copies of \(K_{2,t+1}\) in a graph
- Forbidding multiple copies of forestable graphs
- On the radius of nonsplit graphs and information dissemination in dynamic networks
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- On the independent domination polynomial of a graph
- A spectral version of Mantel's theorem
- Upper bounds for k-tuple (total) domination numbers of regular graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate
- On the extremal eccentric connectivity index of graphs
- Graph metric with no proper inclusion between lines
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Counting independent sets in graphs
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Some values of Ramsey numbers for \(C_4\) versus stars
- The number of multiplicative Sidon sets of integers
- On the Turán number for the hexagon
- A generalization of Moore graphs of diameter two
- On some extremal problems on r-graphs
- Large cycles in graphs
- Intersection properties of finite sets
- Multicolored set multipartite Ramsey numbers
- Graphs of diameter 3 with the minimum number of edges
- A note on the maximum size of Berge-\( C_4\)-free hypergraphs
- Forbidding \(K_{2,t}\) traces in triple systems
- An average degree condition for independent transversals
- Bounds for two multicolor Ramsey numbers concerning quadrilaterals
- The number of 4-cycles in a graph
- Doubling constants and spectral theory on graphs
- Independent sets in polarity graphs
- A note on the Turán function of even cycles
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- The number of \(C_{2\ell}\)-free graphs
- Certain particular families of graphicable algebras
- On multivariate cryptosystems based on computable maps with invertible decomposition
- scientific article; zbMATH DE number 5881230 (Why is no real title available?)
- Lovász, vectors, graphs and codes
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- 4-cycles in mixing digraphs
- The independence number for polarity graphs of even order planes
- Composition Markov chains of multinomial type
- Diameters and Eigenvalues
- Color the cycles
- scientific article; zbMATH DE number 3693338 (Why is no real title available?)
- Finite prime distance graphs and 2-odd graphs
- Uniform hypergraphs containing no grids
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 Q5520566)