Graphs with maximal number of adjacent pairs of edges
From MaRDI portal
Publication:4166778
DOI10.1007/BF01902206zbMath0386.05036OpenAlexW2014315572MaRDI QIDQ4166778
Gyula O. H. Katona, Rudolf Ahlswede
Publication date: 1978
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01902206
Related Items
Paths of length four, Edge isoperimetric inequalities for powers of the hypercube, A note on de Caen's and Nikiforov's inequalities on the sum of squares of the degree sequence of a graph, Walks and paths in trees, A problem of Shapozenko on Johnson graphs, Edge isoperimetric theorems for integer point arrays, A Turán-type problem on distances in graphs, Results on the Wiener profile, On the minimal sum of edges in a signed edge-dominated graph, Maximum bipartite subgraphs of Kneser graphs, Improved enumeration of simple topological graphs, Inequalities for the number of walks in graphs, Asymptotic structure of constrained exponential random graph models, Multipodal structure and phase transitions in large constrained graphs, Tropicalization of graph profiles, The exponential second Zagreb index of \((n, m)\)-graphs, On the maximum number of copies of H in graphs with given size and order, Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture, Simple hypergraphs with maximal number of adjacent pairs of edges, On 4-Sachs optimal graphs, Graphs of fixed order and size with maximal \(A_\alpha\)-index, Maximizing the degree powers of graphs with fixed size, \((n, m)\)-graphs with maximum exponential second Zagreb index, Reflect-push methods. Part I: Two dimensional techniques, On the Number of 4-Edge Paths in Graphs With Given Edge Density, Noise sensitivity in continuum percolation, The number of $4$-cycles and the cyclomatic number of a finite simple graph, Bipartite graphs with the maximum sum of squares of degrees, A note on the irregularity of graphs, Supersaturation and stability for forbidden subposet problems., The sum of the squares of degrees: sharp asymptotics, Maximize the \(Q\)-index of graphs with fixed order and size, Probably Intersecting Families are Not Nested, Triangles in Regular Graphs with Density Below One Half, Extremality of degree-based graph entropies, Maximum values of degree-based entropies of bipartite graphs, The minimum number of disjoint pairs in set systems and related problems, Graphs with the fewest matchings, Extremal threshold graphs for matchings and independent sets, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, On Kruskal's cascades and counting containments in a set of subsets, On the discrepancy between two Zagreb indices, Lagrangians of hypergraphs. II: When colex is best, The minimum degree distance of graphs of given order and size, A Cauchy-Khinchin matrix inequality, On reduced second Zagreb index, Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false, Extreme values of the sum of squares of degrees of bipartite graphs, Unified approach to the generalized Turán problem and supersaturation, Continuous versions of some extremal hypergraph problems. II, Degree powers in \(K_{s,t}\)-minor free graphs, Edge-statistics on large graphs, Note on an extremal problem arising for unreliable networks in parallel computing, Two path extremal graphs and an application to a Ramsey-type problem, On a Conjecture of Nagy on Extremal Densities, Most probably intersecting hypergraphs, Ground states for exponential random graphs, The neighborhood inclusion structure of a graph, Upper bounds for the reduced second zagreb index of graphs
Cites Work
