Another proof of Wright's inequalities

DOI10.1016/J.IPL.2007.05.003zbMATH Open1183.05038OpenAlexW2067281987MaRDI QIDQ2379992FDOQ2379992

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

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of connected sparsely edged graphs
• The birth of the giant component
• Counting connected graphs inside-out
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of connected sparsely edged graphs. III. Asymptotic results
• Counting connected graphs asymptotically
• The average size of giant components between the double-jump
• On the number of sparse connected graphs

Cited In (3)

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

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)