On Graphs that do not Contain a Thomsen Graph
From MaRDI portal
Publication:5567713
Recommendations
- scientific article; zbMATH DE number 3880746
- scientific article; zbMATH DE number 3933121
- On graphs that do not contain the cube and related problems
- On non-denumerable graphs
- scientific article; zbMATH DE number 18335
- scientific article; zbMATH DE number 15664
- The structure of graphs not topologically containing the Wagner graph
- scientific article; zbMATH DE number 426364
- On graphs induced by non-empty subsets
- Graphs without theta subgraphs
Cited in
(only showing first 100 items - show all)- 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
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- On a class of degenerate extremal graph problems
- Some remarks on Boolean sums
- On another Boolean matrix
- Graphs whose every independent set has a common neighbour
- On the combinatorial problems which I would most like to see solved
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- On a Turán type problem of Erdős
- Davenport-Schinzel theory of matrices
- On multicolor Ramsey numbers for complete bipartite graphs
- Graphs from projective planes
- On graphs which contain all small trees
- Radius, diameter, and minimum degree
- A note on large graphs of diameter two and given maximum degree
- Polarities and \(2k\)-cycle-free graphs
- Graphs of diameter two with no 4-circuits
- Norm-graphs: Variations and applications
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- Graphs without theta subgraphs
- Some extremal results on complete degenerate hypergraphs
- Two-regular subgraphs of odd-uniform hypergraphs
- Bipartite algebraic graphs without quadrilaterals
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Some geometric structures and bounds for Ramsey numbers
- Graphs without quadrilaterals
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- On generalized Ramsey theory: The bipartite case
- On product representation of powers. I
- Some extremal results on 4-cycles
- Regular Turán numbers of complete bipartite graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Generalized Turán problems for complete bipartite graphs
- On subgraphs of tripartite graphs
- On the mutual visibility in Cartesian products and triangle-free graphs
- Tight bounds for powers of Hamilton cycles in tournaments
- Inverse Turán numbers
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- Some extremal results on hypergraph Turán problems
- Forbidding multiple copies of forestable graphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Generalized Turán problems for even cycles
- New bounds on even cycle creating Hamiltonian paths using expander graphs
- Ramsey-goodness -- and otherwise
- Approximate Moore graphs are good expanders
- A relative bound for independence
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Counting independent sets in graphs
- Some values of Ramsey numbers for \(C_4\) versus stars
- Improved lower bounds on the degree-diameter problem
- On the Turán number for the hexagon
- Multi-color Ramsey numbers of even cycles
- On some extremal problems on r-graphs
- On the existence of triangulated spheres in 3-graphs, and related problems
- Norm-graphs and bipartite Turán numbers
- A hierarchy of randomness for graphs
- A note on large Cayley graphs of diameter two and given degree
- Multicolored set multipartite Ramsey numbers
- Forbidding \(K_{2,t}\) traces in triple systems
- An average degree condition for independent transversals
- Bounds for two multicolor Ramsey numbers concerning quadrilaterals
- Diameter, edge-connectivity, and \(C_4\)-freeness
- On the Zarankiewicz problem for intersection hypergraphs
- General properties of some families of graphs defined by systems of equations
- Orthogonal polarity graphs and Sidon sets
- 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
- Cops and robbers on graphs based on designs
- Unitary graphs
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- The number of \(C_{2\ell}\)-free graphs
- On the edit distance from \(K_{2,t}\)-free graphs
- Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree
- Turán problems for integer-weighted graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3880746 (Why is no real title available?)
- Random algebraic construction of extremal graphs
- List-coloring the square of a subcubic graph
- On Negations in Boolean Networks
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Diameters and Eigenvalues
- Graphs without four-cycles
- Maximum degree in graphs of diameter 2
- Uniform hypergraphs containing no grids
- On the Turán number of forests
- The edit distance function and symmetrization
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Turán numbers of bipartite graphs plus an odd cycle
- Extremal edge polytopes
- Ramsey Graphs and Block Designs. I
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Approaching the Moore bound for diameter two by Cayley graphs
- Paul turán, 1910–1976: His work in graph theory
- On paul turán's influence on graph theory
- Extremal graphs without three‐cycles or four‐cycles
This page was built for publication: On Graphs that do not Contain a Thomsen Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567713)
