Pages that link to "Item:Q1402082"
From MaRDI portal
The following pages link to An upper bound on the sum of squares of degrees in a hypergraph (Q1402082):
Displaying 16 items.
- On degree sums of a triangle-free graph (Q465274) (← links)
- Noise sensitivity in continuum percolation (Q466111) (← links)
- Extremality of degree-based graph entropies (Q506695) (← links)
- A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications (Q1720743) (← links)
- Upper bound on the sum of powers of the degrees of graphs with few crossings per edge (Q2009245) (← links)
- Lagrangians of hypergraphs. II: When colex is best (Q2040206) (← links)
- Degree powers in \(K_{s,t}\)-minor free graphs (Q2075529) (← links)
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false (Q2308316) (← links)
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs (Q2448897) (← links)
- The sum of the squares of degrees: sharp asymptotics (Q2463904) (← links)
- Sums of powers of the degrees of a graph (Q2501568) (← links)
- ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS (Q2872000) (← links)
- Upper bounds on the sum of powers of the degrees of a simple planar graph (Q3005113) (← links)
- Extremal Trees with Respect to Some Versions of Zagreb Indices Via Majorization (Q4617723) (← links)
- Partially Observed Boolean Sequences and Noise Sensitivity (Q5418805) (← links)
- The first general Zagreb index of graphs and their line graphs (Q6584752) (← links)
