Another proof of Wright's inequalities

DOI10.1016/J.IPL.2007.05.003MaRDI QIDQ2379992zbMATH OpenOpenAlexFDO

Authors Vlady Ravelomanana

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.05.003

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Asymptotic properties of labeled connected graphs
• A new proof of the Fisher-Ryan bounds for the number of cliques of a graph
• Enumerating graphs and Brownian motion
• Asymptotic enumeration of sparse 2-connected graphs
• Inequalities involving the irredundance number of a graph

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Counting connected graphs asymptotically
• Counting connected graphs inside-out
• On the number of sparse connected graphs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The average size of giant components between the double-jump
• The birth of the giant component
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. III. Asymptotic results

Cited in

(3)

• Random 2 XORSAT phase transition
• Random 2-XORSAT at the Satisfiability Threshold
• Birth and growth of multicyclic components in random hypergraphs

This page was built for publication: Another proof of Wright's inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379992)