On the number of graphs without 4-cycles

From MaRDI portal
Publication:1167182

DOI10.1016/0012-365X(82)90204-7zbMath0491.05035WikidataQ105583512 ScholiaQ105583512MaRDI QIDQ1167182

Kenneth J. Winston, Daniel J. Kleitman

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items

Independent sets in algebraic hypergraphs, The number of \(B_3\)-sets of a given cardinality, The number of \(C_{2\ell}\)-free graphs, Number of Cliques in Graphs with a Forbidden Subdivision, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, The number of hypergraphs without linear cycles, Interview with Yufei Zhao, On the number of matroids, Counting H-free orientations of graphs, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, Online containers for hypergraphs, with applications to linear equations, On the number of cliques in graphs with a forbidden minor, Counting \(r\)-graphs without forbidden configurations, The Star Degree Centrality Problem: A Decomposition Approach, On the maximum number of integer colourings with forbidden monochromatic sums, Supersaturation in posets and applications involving the container method, How many delta-matroids are there?, On a question of Vera T. Sós about size forcing of graphons, Applications of graph containers in the Boolean lattice, Uniform chain decompositions and applications, Approximately counting independent sets in bipartite graphs via graph containers, Balanced supersaturation for some degenerate hypergraphs, The number of multiplicative Sidon sets of integers, On the number of high‐dimensional partitions, Extremal problems in hypergraph colourings, Random multilinear maps and the Erd\H{o}s box problem, Lower bounds for piercing and coloring boxes, The fine structure of octahedron-free graphs, The structure of almost all graphs in a hereditary property, The asymptotics of \(r(4,t)\), Coloring lines and Delaunay graphs with respect to boxes, Counting orientations of random graphs with no directed k‐cycles, On the Number ofBh-Sets, Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Extremal Theory of Locally Sparse Multigraphs, Counting configuration-free sets in groups, The number of \(K_{m,m}\)-free graphs, Sum-Free Sets of Integers with a Forbidden Sum, Representations of graphs and networks (coding, layouts and embeddings), Embedding Graphs into Larger Graphs: Results, Methods, and Problems, \(K_4\)-free subgraphs of random graphs revisited, On the number of matroids compared to the number of sparse paving matroids, Hypergraph containers, On the number of \(r\)-matchings in a tree, Turán numbers for Berge-hypergraphs and related extremal problems, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, Counting sum-free sets in abelian groups, On the number of bases of almost all matroids, On the number of generalized Sidon sets, Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs, The number of graphs without forbidden subgraphs, Independent sets in hypergraphs, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, Counting independent sets in graphs, Random Ramsey graphs for the four-cycle, The regularity method for graphs with few 4‐cycles



Cites Work