Pages that link to "Item:Q2922865"
From MaRDI portal
The following pages link to The number of the maximal triangle-free graphs (Q2922865):
Displaying 26 items.
- A sharp bound on the number of maximal sum-free sets (Q322191) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Enumerating solution-free sets in the integers (Q509275) (← links)
- Triangle-free regular graphs (Q1182587) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- The generation of maximal triangle-free graphs (Q1576571) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- On solution-free sets of integers (Q2403693) (← links)
- Maximal independent sets in clique-free graphs (Q2674559) (← links)
- The number of maximal sum-free subsets of integers (Q2944846) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS (Q3449989) (← links)
- On maximal triangle‐free graphs (Q4309986) (← links)
- (Q4347896) (← links)
- A note on the maximum number of triangles in a <i>C</i><sub>5</sub>‐free graph (Q4629994) (← links)
- Upper triangle free detour number of a graph (Q5063268) (← links)
- (Q5144372) (← links)
- Counting Independent Sets in Hypergraphs (Q5495674) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
- The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)
- On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza (Q6094038) (← links)
- Probabilistic hypergraph containers (Q6594751) (← links)
