<｜begin▁of▁sentence｜>### Instruction:
As a cartoonist crafting illustrations for a popular comic strip, I've been tasked with creating a visual representation of the degree distribution in a network. Let's imagine our comic strip features a quirky town with 100 unique characters, each potentially connected by various relationships. To capture the essence of these connections, I must generate a degree histogram showcasing how many connections each character has.

Utilizing the "NetworkX" API, I'll simulate the relationships within our town using the Erdos-Renyi random graph model. In this model, every character has a chance of being connected to another with a probability of 0.1. Once the network is generated, I'll construct a histogram displaying the distribution of character degrees, with bars representing the count of characters and ensuring the final illustration fits within the confines of an 80-character maximum line width.
### Response:
from igraph import Graph, summary
from math import ceil

# Create a graph
g = Graph.Erdos_Renyi(n=100, p=0.1)

# Generate degree histogram
histogram = g.degree_distribution()

# Convert histogram to string with max_width of 80 and showing bars
histogram_string = histogram.to_string(max_width=80, show_bars=True, show_counts=True)

print(histogram_string)
<|EOT|>
