Extremal graphs without three‐cycles or four‐cycles
From MaRDI portal
Publication:4271621
DOI10.1002/jgt.3190170511zbMath0784.05033OpenAlexW1966969478MaRDI QIDQ4271621
Y. H. Harris Kwong, David K. Garnick, Felix Lazebnik
Publication date: 21 March 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170511
Related Items
The NIP graph of a social welfare function, Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs, Total forcing sets and zero forcing sets in trees, Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\), Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\), Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\), Optimal identification of sets of edges using 2-factors, The number of 4-cycles in a graph, Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals, Size of Graphs with High Girth, New results on EX graphs, Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs, Graphs with maximum size and lower bounded girth, Extremal Theory of Locally Sparse Multigraphs, The forcing number of graphs with given girth, Max-cut and extendability of matchings in distance-regular graphs, Unnamed Item, Nonpositive sectional curvature for (𝑝,𝑞,𝑟)-complexes, New families of graphs without short cycles and large size, On the girth of extremal graphs without shortest cycles, Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\), Constraints for symmetry breaking in graph representation, On Extremal Graphs with Bounded Girth, Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\), On extremal bipartite graphs with high girth, Density of balanced 3-partite graphs without 3-cycles or 4-cycles
Cites Work
