Pages that link to "Item:Q1403918"
From MaRDI portal
The following pages link to The size of bipartite graphs with a given girth (Q1403918):
Displaying 19 items.
- On regular hypergraphs of high girth (Q405152) (← links)
- Extremal edge polytopes (Q405274) (← links)
- New bounds on \(\bar{2}\)-separable codes of length 2 (Q488247) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
- On the Turán number for the hexagon (Q2497327) (← links)
- Codes with girth 8 Tanner graph representation (Q2638415) (← links)
- On the structure of random graphs with constant \(r\)-balls (Q2693149) (← links)
- Small graphs and hypergraphs of given degree and girth (Q2699648) (← links)
- The Turán number of directed paths and oriented cycles (Q2701405) (← links)
- An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- (Q5091259) (← links)
- Extremal absorbing sets in low-density parity-check codes (Q6112248) (← links)
- A note on pseudorandom Ramsey graphs (Q6192225) (← links)
