scientific article; zbMATH DE number 6536189
From MaRDI portal
Publication:3464534
Recommendations
- Distances and diameters on iterated clique graphs
- Distances and diameters on iterated clique graphs
- On the radius and diameter of the clique graph
- scientific article; zbMATH DE number 4049680
- Cycles, Paths, Connectivity and Diameter in Distance Graphs
- On the number of cliques and cycles in graphs
- Radius and diameter with respect to cliques in graphs
- Clique number and distance spectral radii of graphs.
- Distance-regular graphs of large diameter that are completely regular clique graphs
- Clique cycle-transversals in distance-hereditary graphs
Cited in
(72)- On the chromatic numbers of rational spaces
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Diameters of random distance graphs
- On the stability of the independence number of a random subgraph
- Chromatic numbers of spheres
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Bounds on Borsuk numbers in distance graphs of a special type
- New Turán type bounds for Johnson graphs
- Spectrum of Johnson graphs
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
- On the minimal number of edges in induced subgraphs of special distance graphs
- On a Frankl-Wilson theorem
- Chromatic numbers of some distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- On stability of the independence number of a certain distance graph
- On dividing sets into parts of smaller diameter
- Exponentially Ramsey sets
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On threshold probability for the stability of independent sets in distance graphs
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- On lower bounds for the chromatic number of spheres
- Clique chromatic numbers of intersection graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- The number of edges in induced subgraphs of some distance graphs
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Clique numbers of random subgraphs of some distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- On chromatic numbers of close-to-Kneser distance graphs
- Lower bounds for the chromatic numbers of distance graphs with large girth
- On simplices in diameter graphs in \(\mathbb{R}^4\)
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Turán-type bounds for distance graphs
- On computational complexity of length embeddability of graphs
- Turán-type results for distance graphs in an infinitesimal plane layer
- Clique number and ball containment number of unit ball graphs
- Coloring distance graphs and graphs of diameters
- Independence numbers of random subgraphs of a distance graph
- Clique-to-vertex monophonic distance in graphs
- Clique cycle-transversals in distance-hereditary graphs
- On the number of edges in induced subgraphs of a special distance graph
- Independence numbers of random subgraphs of distance graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Turán type results for distance graphs
- On chromatic numbers of nearly Kneser distance graphs
- Diameters of iterated clique graphs of chordal graphs
- scientific article; zbMATH DE number 4049680 (Why is no real title available?)
- On the chromatic number of an infinitesimal plane layer
- On the Frankl-Rödl theorem
- scientific article; zbMATH DE number 866045 (Why is no real title available?)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- Connectedness of unit distance subgraphs induced by closed convex sets
- On the stability of some Erdős-Ko-Rado type results
- scientific article; zbMATH DE number 7280158 (Why is no real title available?)
- On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces
- The connection between the Borsuk and Erdös-Hadwiger problems
- Cycles, Paths, Connectivity and Diameter in Distance Graphs
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
- On the partition of plane sets into 6 subsets of small diameter
- Lower bound on the minimum number of edges in subgraphs of Johnson graphs
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
- The chromatic number of space with forbidden regular simplex
- On two-distance (0,1)-counterexamples to Borsuk's conjecture in l_p metrics
- The minimum number of cliques in induced subgraphs of Johnson graphs
- Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Involving \(d\)-convex simple and quasi-simple planar graphs in \(\mathbb R^3\)
- On threshold probabilities for the realization of a random graph by a geometric graph
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 Q3464534)
